Core Patterns
Linked Lists
Rewire nodes instead of shifting elements: dummy heads, in-place reversal, fast & slow pointers, and merging, splitting and reordering chains.
0 of 3 lessons complete, 0 of 8 problems solved
Coursework
38 min
Up next
Nodes, Pointers & the Dummy Head
Build, walk and edit a singly linked list, and use a dummy head to kill edge cases.
12 min
Reversing In Place
The three-pointer reversal, traced step by step, plus reversing just a slice of the list.
12 min
Fast & Slow Pointers, Gaps and Merging
Find the middle, detect cycles, locate the nth node from the end, and merge or split lists.
14 min
Practice ladder
Start with the first problem, then work toward the harder variations. Run examples before submitting against all tests.
Next unit: Trees: DFS & BFS