# Find The Celebrity: Explained
Find The Celebrity shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
A two-pass: first shrink the candidate by knows(a,b) (the known person may still be the celebrity, the knower cannot), then verify the candidate against everyone.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (graph BFS, Dijkstra, Union-Find, or interval DP) 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).
## Common mistake
Checking every pair, which is O(n^2) and wastes the API cache.
## 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 www.linkjob.ai.