# Find The Celebrity Party: Explained
Find The Celebrity Party shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Two-pass: first shrink the candidate by asking know(a,b), then verify the candidate against everyone. Or discard with a stack.
## 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) calls.
## Common mistake
Asking the full n^2 matrix.
## 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 Linkjob.ai.