Priority Queue Problems
Priority queues maintain elements in sorted order by priority, giving O(log n) insertion and extraction. These problems involve task scheduling, event simulation, and top-K queries.
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 |