Detect Cycle
If fast ever lands on slow, the list loops. On a straight list fast just runs out.
Decision · step 2 of 6Fast and Slow Pointers: A list that loops
Step 1: slow to 2, fast to 3.
What you will see
The list loops back on itself; the fast pointer laps the slow one and they collide.
Cost
| Best | O(n) |
|---|---|
| Average | O(n) |
| Worst | O(n) |
| Space | O(1) |
How you work with it here
play it through, step one change at a time, scrub to any step, run it on your own input, predict what happens next, try operations in any order.
Screen readers: Each node announces its value and what it points to; each step announces the pointer change ("node 3 now points to node 5").
Reduced motion: Pointer arrows redraw in place with a brief emphasis instead of animating the detach and reattach.
Before this
Related
Taught by the same lesson
Fast and Slow Pointers covers these too, in the same run.