← Two Pointers

Pattern Recognition Drill

#14 — Find middle node

Easy Linked Lists

The Problem

Find the middle node of a linked list.

What approach would you use?

Think about it before scrolling down.

Key Signals

Two Pointers

Slow (1 step) and fast (2 steps). When fast hits end, slow is at the middle. One pass, O(1) space.

Common Trap

Counting length then iterating to n/2 works but requires two passes. Slow/fast does it in one.

← #13 #15 →