🐢🐰 Fast & Slow Pointers — Floyd's Cycle Detection
USACO C++ Book · Interactive Visualizer
🔗 Floyd's Cycle Detection on a Linked List
Linked List
O(N) · O(1) space
Step 0/0
📊 Linked List
slow and fast start at head
🗂 State
Phase 1: fast moves 2 steps, slow moves 1 step. If they meet → cycle exists.
💻 Code
Click Next Step to start
◀ Prev
Next Step ▶
↺ Reset
0/0
Keyboard:
→
Next
←
Prev
R
Reset