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 →
In-place
4 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
Reverse Linked List II — In-Place Partial Reversal
Reverse the portion of a linked list between positions left and right in one pass using careful pointer manipulation.
Read →
dsa2 min read
Flatten Binary Tree to Linked List — Morris Traversal
Flatten a binary tree in-place into a linked list following pre-order using the Morris traversal approach.
Read →