Floyd’s cycle detection (tortoise and hare): what does it detect and what are its time/space costs?

Answer

It detects cycles in a linked list or any iterative sequence by moving one pointer twice as fast as the other. If they meet, there’s a cycle. It runs in O(n) time and O(1) extra space.