Loop

Linked List

Pointer surgery, dummy nodes, fast/slow pointers, and k-way merging.

0 of 8 lessons complete · 172 min total

Start module
  1. Pointer Surgery & Dummy NodesThe prev/curr/next reversal dance, dummy-head tricks that erase edge cases, and combining find-middle + reverse + merge into compound operations.Lesson · 17 minNot completed
  2. Reversal as Train CouplingEvery pointer reassignment as a physical action.Animation · 10 minNot completed
  3. Tortoise & HareCycle detection and cycle-start finding with two speeds.Animation · 10 minNot completed
  4. K-Way MergeMerging many sorted sources through one funnel.Animation · 9 minNot completed
  5. Practice: Core SurgeryReversal, dummy-node merging, cycle detection, and the middle-reverse-interleave combo.easy×3medium4 problems · 0 solvedPractice · 32 minNot completed
  6. Practice: Gaps, Clones & CarriesOffset pointers, cloning with a node map, carry arithmetic, and Floyd's on an array-as-graph.medium×44 problems · 0 solvedPractice · 40 minNot completed
  7. Practice: Design & Hard SurgeryThe hash-map-plus-doubly-linked-list LRU, divide-and-conquer k-list merging, and in-place group reversal.mediumhard×23 problems · 0 solvedPractice · 45 minNot completed
  8. Linked List CheckpointPointer-order pitfalls, dummy-node use, fast/slow applications, and LRU internals.Checkpoint · 9 minNot completed