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 →
Linked-list
2 articles
dsa6 min read
Linked Lists Master Recap — All Patterns & Templates
Complete cheatsheet for Linked Lists: all 7 patterns, template code, Big O reference, and MAANG interview priority guide.
Read →