PATTERN 06 · 5 PROBLEMS
Linked-list rewiring
Change relationships through saved references; never lose the remainder of the list.
Start the first lesson ↗MASTER KEYSave next before you change next.
0OF 5
RECALLED
RECALLED
Each rewiring must preserve access to the unprocessed suffix.
Not started
↗02Reverse Linked List
Each rewiring must preserve access to the unprocessed suffix.
Not started
↗03Merge Two Sorted Lists
The smaller current head is the next globally smallest node.
Not started
↗04Reorder List
The target order interleaves the first half with the reversed second half.
Not started
↗05Remove Nth Node From End of List
A fixed gap lets the trailing pointer land before the removal node.
Not started
↗Linked List Cycle
A fast pointer eventually laps a slow pointer only inside a cycle.