# Misra-Gries Frequent Items Sketch: Practice Notes
Misra-Gries Frequent Items Sketch shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Keep up to k-1 labeled counters; a new unseen item decrements every counter when the table is full, deleting zeros.
## 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(k) space; any item with frequency > n/k is reported.
## Common mistake
Decrementing only one counter when the table is full instead of all of them.
## 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 multilingual AI interview assistant.