Heap Problems
Heaps (priority queues) efficiently track the min or max element. Essential for problems involving K-th largest element, merge K sorted lists, and scheduling.
4 problems
| Title | Difficulty | Platform |
|---|---|---|
| Minimum Cost to Hire K Workers | Hard | LeetCode |
| Minimum Number of Refueling Stops | Hard | LeetCode |
| Sliding Window Maximum | Hard | LeetCode |
| Swim in Rising Water | Hard | LeetCode |