Heap
ProUse when you need to efficiently find or maintain the k largest, smallest, or most frequent elements, or when repeatedly extracting the min or max.
Use when you need to efficiently find or maintain the k largest, smallest, or most frequent elements, or when repeatedly extracting the min or max.
Keywords for identifying Heap Problems
→ Find kth largest / kth smallest
→ Top k / k most frequent / k closest
→ Stream of data + maintain running top k
→ Repeatedly pick or remove the max / min element
→ Sort or reorder by frequency / priority
Unlock the Heap template
Get the full code template and worked LeetCode examples for Heap — plus every other pattern in the library — with a one-time $29 lifetime upgrade.
Upgrade to ProSee free Binary Search template →