Topic 14 of 21
Heap & Priority Queue Problems
Binary heaps and priority queues: Kth largest and smallest, merging sorted lists, task scheduler, median of a data stream and top K frequent elements.
17 heap & priority queue problems (5 easy, 10 medium, 2 hard) with LeetCode and GeeksforGeeks links.
Your progress
– / 17 solved
- Easy
- –/5
- Medium
- –/10
- Hard
- –/2
/
- Introduction to Priority Queues Using Binary HeapsMediumGFG
- Min Heap and Max Heap ImplementationMediumGFG
- Check If an Array Represents a Min-Heap or NotMediumGFG
- Convert Min Heap to Max HeapMediumGFG
- Kth Largest Element in an Array [Use Priority Queue]EasyLeetCodeGFG
- Kth Smallest Element in an Array [Use Priority Queue]EasyGFG
- Sort K Sorted ArrayEasyGFG
- Merge M Sorted ListsHardLeetCodeGFG
- Replace Each Array Element by Its Corresponding RankEasyGFG
- Task SchedulerMediumLeetCodeGFG
- Hands of StraightsMediumLeetCodeGFG
- Design TwitterMediumLeetCodeGFG
- Connect N Ropes with Minimal CostMediumGFG
- Kth Largest Element in a Stream of Running IntegersEasyLeetCodeGFG
- Maximum Sum CombinationMediumGFG
- Find Median from Data StreamHardLeetCodeGFG
- K Most Frequent ElementsMediumLeetCodeGFG