Heap and Priority Queue coding problems

Heaps keep the smallest or largest item ready in O(log n): top k elements, merging sorted lists, running medians and scheduling by priority.

18 problems: 9 easy, 8 medium, 1 hard. Free to read; a free account solves them and earns XP and Aura.

1. Find M Smallest ElementsPractice · +10 XP · heaps, priority queueseasy
2. Find Smallest and Largest ElementsPractice · +10 XP · heaps, min-maxeasy
3. K-th Largest ElementPractice · +10 XP · heaps, k-th elementeasy
4. Print Largest N IntegersPractice · +10 XP · heaps, priority queues, top-keasy
5. Print Last K ElementsPractice · +10 XP · heaps, priority queueseasy
6. Smallest Element After RemovalsPractice · +10 XP · heaps, priority queueseasy
7. Sum of First K ElementsPractice · +10 XP · heaps, priority queues, k-selectioneasy
8. Top K Smallest ElementsPractice · +10 XP · heaps, priority queues, top-keasy
9. Top Three ScoresPractice · +10 XP · heaps, sorting, top-keasy
10. Distinct Element Sum with Minimum CostPractice · +20 XP · heaps, hash map, greedymedium
11. Distinct Elements with Minimum Total CostPractice · +20 XP · heaps, hash set, greedymedium
12. Find K Distinct Element FrequenciesPractice · +20 XP · heaps, frequency counting, top-kmedium
13. Find K Smallest Distinct ElementsPractice · +20 XP · heaps, priority queues, distinct elementsmedium
14. Find Minimums in Sliding WindowsPractice · +20 XP · heaps, sliding window, dequemedium
15. Maximize Distinct Elements After OperationsPractice · +20 XP · heaps, greedy, data structuresmedium
16. Merge K Sorted ListsPractice · +20 XP · heaps, merging, priority queuesmedium
17. Process Tasks by DeadlinePractice · +20 XP · heaps, scheduling, greedymedium
18. Minimize Maximum Difference of Elements in IntervalsPractice · +30 XP · heaps, sliding window, greedyhard