# Find The Winner Of The Circular Game: Explained
Find The Winner Of The Circular Game shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
n friends count from 1 to k and the k-th is eliminated, Josephus-style, until one remains. Recurrence f(1)=0, f(n)=(f(n-1)+k)%n in 0-based indexing, then add 1.
## 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).
## Common mistake
Simulating with a list is fine for n<=500 but off-by-one errors are common when mixing 0- and 1-based positions.
## 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 job search and interview copilot.