dsa1 min read
Swap Nodes in Pairs — In-Place Pointer Rewiring
Swap every two adjacent nodes in a linked list without modifying node values using pointer rewiring.
Read →
All Posts
1276 articles
dsa1 min read
Odd Even Linked List — Two Chain In-Place
Group all odd-indexed nodes before even-indexed nodes in O(n) time and O(1) space using two pointer chains.
Read →
dsa2 min read
Rotate List — Find Length and Reconnect
Rotate a linked list to the right by k places by finding length, computing effective rotation, and rewiring.
Read →
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 →
dsa1 min read
Add Two Numbers — Simulate Carry with Dummy Head
Add two numbers represented as reversed linked lists by simulating digit addition with carry propagation.
Read →
Page 78 of 256