🏔
Start studying →Heap / Priority Queue
Top-K, streaming, and merge patterns
2 Easy2 Medium1 Hard
All Problems
| # | Problem | Difficulty |
|---|---|---|
| 703 | Kth Largest Element in a Stream | Easy |
| 1046 | Last Stone Weight | Easy |
| 973 | K Closest Points to Origin | Medium |
| 621 | Task Scheduler | Medium |
| 295 | Find Median from Data Stream | Hard |