# Charikar Count Sketch Median: Interview Notes

Charikar Count Sketch Median shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Hash each item to a bucket and a random sign, add the signed update, and estimate a frequency by the median of several independent repetitions.

## 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(eps^{-2} log(1/delta)) space for additive error eps ||f||_2.

## Common mistake

Reporting the mean of the repetitions instead of the median, which is not robust to a single overloaded table.

## 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 undetectable AI interview copilot.