Watch Floyd's tortoise and hare algorithm detect a linked list cycle. Step through slow and fast pointers, find the cycle entry or the middle node.
Problem
Nodes
6
Last node points to
Step 0 / 9
800 ms
T: tortoise, 1 step H: hare, 2 steps Answer
Press Start to move the two pointers.