Quiz — Fast and Slow Pointers

Why do fast and slow pointers work on a sequence where each value is computed from the one before, with no linked list in sight?

They only detect cycles of length 2

Each value fixes the next, so a repeated value means the sequence cycles, exactly like a list whose last node points back

They need nodes with next references, so the values must first be copied into a linked list