# Misra Gries Frequent Items: Practice Notes

Misra Gries Frequent Items shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Keep k counters: increment on a hit, and if the item is new and the table is full, decrement every counter and drop zeros, so every item over n/(k+1) is reported.

## 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 and O(1) extra time per update with a hashmap.

## Common mistake

Resetting the table instead of decrementing all counters, which can drop a truly frequent item.

## 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 AI interview helper that uses your resume.