Heap / Priority Queue

Use heaps to find top k elements efficiently.

Merge multiple sorted lists efficiently using heaps.

Use two heaps to maintain dynamic medians and partitions.

Combine heaps with hash maps for frequency-based problems.