# Cycle Detection With Floyd Tortoise And Hare: Study Guide

Cycle Detection With Floyd Tortoise And Hare shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Move one pointer by one and another by two; after they meet, reset one to the head to find the cycle start.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n) time, O(1) space.

## Common mistake

Not checking fast.next before advancing two steps.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at official website.