Top-k problems
Keep a heap of only k items — a min-heap for the k largest — and pay O(n log k).
This lesson is part of Pro.
Free covers the C and Python courses, the first three DSA topics, the opening system design lessons and the beginner AI lessons, all with the full coach. Pro opens the rest of the library in the FollowtheDamnCode app.