dsa2 min read
Merge Two Sorted Lists — Dummy Head Merge
Merge two sorted linked lists into one sorted list using a dummy head node to simplify pointer management.
Read →
Merge
3 articles
dsa1 min read
Reorder List — Split, Reverse, Merge
Reorder a linked list into L0→Ln→L1→Ln-1 pattern by splitting at middle, reversing second half, then merging.
Read →
dsa2 min read
Amazon — Merge K Sorted Lists (Min-Heap)
Merge k sorted linked lists into one sorted list using a min-heap. O(n log k) time by always extracting the current minimum across all list heads.
Read →