hone
.sh
Browse topics
Learn
Software
Algorithms
Heaps & Priority Queues
Heaps & Priority Queues
Keep the smallest or largest item ready in logarithmic time, for top-k, merging and scheduling.
01
How a Heap Works
easy
Pro
→
02
Last Stone Standing
easy
Pro
→
03
Kth Largest in a Stream
medium
Pro
→
04
K Closest Points to the Origin
medium
Pro
→
05
Schedule Tasks with a Cooldown
medium
Pro
→
06
Merge K Sorted Lists
hard
Pro
→
07
Running Median
hard
Pro
→