Heaps & Priority Queues

Problems in this path

1. 01
   Kth Largest Element
   Easy · Size-k Min-Heap
   Open
2. 02
   Top K Frequent Values
   Medium · Frequency Map + Heap
   Open
3. 03
   Merge K Sorted Arrays
   Hard · Multiway Merge
   Open
4. 04
   Last Stone Weight
   Easy · Max Heap
   Open
5. 05
   K Closest Points
   Medium · Size-K Heap
   Open
6. 06
   Minimum Meeting Rooms
   Medium · End-Time Min Heap
   Open
7. 07
   Task Scheduler Cooldown
   Medium · Frequency Max Heap
   Open
8. 08
   Kth Smallest in Sorted Matrix
   Medium · Heap Merge of Rows
   Open
9. 09
   Maximise Project Capital
   Hard · Two-Heap Selection
   Open
10. 10
    Running Median
    Hard · Two Heaps
    Open

Read first