15 essential heap and priority queue problems covering Top-K, merge K lists, scheduling, and greedy heap patterns.
15 道題目
| # | 題目 | 難度 |
|---|---|---|
| 1 | Hard | |
| 2 | Medium | |
| 3 | Hard | |
| 4 | Medium | |
| 5 | Medium | |
| 6 | Medium | |
| 7 | Hard | |
| 8 | Hard | |
| 9 | Medium | |
| 10 | Hard | |
| 11 | Medium | |
| 12 | Easy | |
| 13 | Medium | |
| 14 | Easy | |
| 15 | Hard |