Last Minute Notes
Github
Docs
Learn
Search
⌘
K
@sayanstwt
Lessons
Learn
/
Data Structures & Algorithms
/
Trees & Heaps
Top K Elements
7 min
Intermediate
8 steps
A size-k heap beats sorting everything.
n
6
k
2
Want
kth largest
3
2
1
5
6
4
find the 2nd largest of [3, 2, 1, 5, 6, 4]
current
visited
done
In this lesson
Step 1 of 8
1
The problem
2
Min-heap
3
Push, pop
4
The answer
5
Frequent
6
Options
7
Buckets
8
Recap