Skip to content
BytePatterns

Linked Lists

Follow the pointers — and learn every trick they hide.

Linked Lists progress0 / 6
  1. Singly Linked List BasicsEach item carries the address of the next one.4m
  2. Traversal and SearchOne node at a time is the only way through.4m
  3. Insert and DeleteRewire two links, and nothing else has to move.5m
  4. Reverse a Linked ListFlip every arrow backwards using three pointers.5m
  5. Fast and Slow PointersOne hop versus two finds the middle in one pass.5m
  6. Detect a CycleIf the list loops, the fast pointer laps the slow one.5m