dsa2 min read
Reverse Linked List — Iterative and Recursive
Reverse a singly linked list iteratively with three-pointer technique and recursively with call stack.
Read →
Reversal
8 articles
dsa1 min read
Palindrome Linked List — Split, Reverse, Compare
Check if a linked list is a palindrome by finding the middle, reversing the second half, then comparing.
Read →
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 →
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
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
Maximum Twin Sum of a Linked List — Split and Reverse
Find the maximum sum of twin nodes (node i + node n-1-i) by reversing the second half and comparing pairs.
Read →
dsa2 min read
Reverse Nodes in Even-Length Groups — Group Counting
Reverse nodes in each even-length group of a linked list by counting group sizes and selectively reversing.
Read →
dsa2 min read
Reverse Nodes in k-Group — Recursive Group Reversal
Reverse every k nodes of a linked list recursively: check k nodes exist, reverse them, recurse on the rest.
Read →