# Check If All Characters Have Equal Number Of Occurrences: Explained
Check If All Characters Have Equal Number Of Occurrences shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
A good string has every present character appearing the same number of times. Count frequencies and check that the set of positive counts has size 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
Requiring all 26 letters to appear, or comparing to the length instead of to each other.
## 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.