Linked List
Manipulate node-based data structures using pointer techniques like fast/slow, dummy heads, and in-place reversal.
- • Node insertion/deletion
- • Cycle detection
- • Merging sorted sequences
- • Reversing sequences
- • Need random access by index
- • Need cache-friendly iteration
- • Losing reference to nodes
- • Not using dummy head for edge cases
- • Infinite loops in cycle problems
Key Invariant
Pointer manipulation is the core skill — draw the before/after state before coding