24 worked problems

Linked List

Pointer surgery on chained nodes. The problem is about rearranging, locating, or comparing nodes without random access.

Recognition signal

When should you think of Linked List?

The problem is about rearranging, locating, or comparing nodes without random access.

Core invariant

What must stay true?

Every pointer update preserves access to the unprocessed remainder of the list.

Practice in a deliberate order

What to learn in this cluster

  1. 01Linear pointer walks
  2. 02Fast and slow pointers
  3. 03In-place reversal and list surgery

All Linked List problems

24 of 24 walkthroughs
Continue the cluster

Related patterns and study guides