# Linked List Cycle II: Practice Notes

Linked List Cycle II shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Floyd: slow/fast meet inside the cycle; reset one pointer to the head and walk both one step at a time — they meet at the entrance. No extra set needed.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (linked-list rewiring, two pointers, or a monotonic stack) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n) extra O(1).

## Common mistake

Returning the meeting point itself, which is generally not the entrance.

## 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 AI assistant for technical interviews.