3 min read
Find Median From a Data Stream With Two Heaps
The two-heap balance: max-heap low half, min-heap high half. Python solution and complexity analysis for the heap and top-k interview pattern.
Tag
Heap Top K
Articles tagged Heap Top K on The Augmented Dev.
11 articles
3 min read
K Closest Points to Origin Without Square Roots
Bounded max-heap on squared distance — monotone transforms are free. Python solution and complexity analysis for the heap and top-k interview pattern.
3 min read
Find K Pairs With Smallest Sums: Frontier Expansion
Explore an implicit sorted matrix — seed one row, expand neighbors lazily. Python solution and complexity analysis for the heap and top-k interview pattern.
3 min read
Kth Largest Element: Heap Versus Quickselect
The bounded min-heap of size k — and when quickselect beats it. Python solution and complexity analysis for the heap and top-k interview pattern.
3 min read
Kth Largest in a Stream: The Persistent Bounded Heap
Design a class where the size-k min-heap is the entire state. Python solution and complexity analysis for the heap and top-k interview pattern.
3 min read
Last Stone Weight: Simulation on a Max-Heap
Repeatedly smash the two heaviest — negation makes heapq a max-heap. Python solution and complexity analysis for the heap and top-k interview pattern.
3 min read
Merge K Sorted Lists: The Heap of Heads
K-way merge in O(n log k) — with the tuple tie-break heapq requires. Python solution and complexity analysis for the heap and top-k interview pattern.
3 min read
Reorganize String: Adjacent Duplicates and Greedy Pairing
No two equal neighbors — alternate the two most frequent letters. Python solution and complexity analysis for the heap and top-k interview pattern.
3 min read
Sort Characters by Frequency: Heap or Buckets
Rebuild a string most-frequent-first — full ordering, so no bounded trick. Python solution and complexity analysis for the heap and top-k interview pattern.
3 min read
Task Scheduler: Greedy Frequency Math With a Heap Proof
CPU cooldown scheduling — the frame formula and when idle time vanishes. Python solution and complexity analysis for the heap and top-k interview pattern.
3 min read
Top K Frequent Elements: Count, Then Choose Your Weapon
Counter plus bounded heap — and the bucket-sort answer that beats it. Python solution and complexity analysis for the heap and top-k interview pattern.