# Find Players With Zero Or One Losses: Explained
Find Players With Zero Or One Losses shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
matches[i]=[winner,loser]. Count losses per player (winners with zero recorded losses still count). Return [sorted players with 0 losses, sorted players with 1 loss].
## 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 log n) from sorting.
## Common mistake
Ignoring players who only won, or returning unsorted lists.
## 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 here.