dsa4 min read
Merge K Sorted Lists — K-Way Merge with a Min-Heap
LeetCode 23 (Hard) — the most-asked heap problem at FAANG. Merge k sorted linked lists in O(N log k) using a min-heap that always tracks the smallest active head.
Read →
K-way-merge
2 articles
dsa4 min read
Find K Pairs with Smallest Sums — Heap on an Implicit Sorted Matrix
LeetCode 373 (Medium) — find the k smallest pair sums from two sorted arrays in O(k log k) by treating the implicit pair-sum matrix as a sorted matrix and running a min-heap k-way merge.
Read →