Heap (Priority Queue)

Covers heap fundamentals, top-K problems, streaming data, greedy optimizations, and advanced 2D heap applications.

Filter by difficulty:
Heap Basics
•
Implement Min/Max Heap Easy
Solution
•
Heap Sort (Sort an array using Heap) Medium
Solution
Kth Element & Streaming
•
Median of Data Stream Hard
Solution
•
Kth Largest Element in an Array Medium
Solution
•
Kth Largest Element in a Stream Easy
Solution
•
Kth Smallest Element in a Sorted Matrix Medium
Solution
Greedy + Heap
•
K Pairs with Smallest Sum from Two Arrays Medium
Solution
•
Pick at most K Projects to Maximize Capital Hard
Solution
Advanced Heap (2D / BFS + Heap)
•
Trapping Rain Water II (2D Grid) Hard
Solution
•
The Skyline Problem Hard
Solution