dsa2 min read
Merge K Sorted Lists
Merge K sorted linked lists into one sorted list using a min-heap to always extract the globally smallest node.
Read →
K-way-merge
3 articles
dsa2 min read
Find K Pairs with Smallest Sums
Find K pairs (u, v) with smallest sums from two sorted arrays using a min-heap initialized with first row candidates.
Read →
dsa3 min read
Smallest Range Covering Elements from K Lists
Find the smallest range that contains at least one element from each of K sorted lists using a sliding K-way merge.
Read →