# Number Of Excellent Pairs: Practice Notes
Number Of Excellent Pairs shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
A pair is excellent if popcount(a|b) + popcount(a&b) >= k. That sum equals popcount(a) + popcount(b). Count frequencies of popcounts and two-pointer or suffix-sum them.
## 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 A).
## Common mistake
Computing popcount(a|b) + popcount(a&b) naively for every pair.
## 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 real-time interview help.