Heap / Priority Queue
Maintain priority with heap-based data structures.
7
Problems
0
Easy
0
Medium
7
Hard
When to Use Heap / Priority Queue
Pattern Recognition
Look for these trigger words in problem statements:
kth largest element in a stream
heap
last stone weight
k closest points to origin
kth largest element in an array
task scheduler
design twitter
find median from data stream
Practice Problems
Compare With Other Patterns
Master Heap / Priority Queue
Build pattern recognition with interactive MCQs. Understand why to use Heap / Priority Queue, not just how.
Download LeetEye Free