# Alon Matias Szegedy Sketch: Study Guide

Alon Matias Szegedy Sketch shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Maintain a running sum of random +/-1 (or 4-wise) hashes times frequencies so the squared sum estimates the second frequency moment F2.

## 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(1/eps^2 log(1/delta)) counters for a (1+eps) approximation of F2.

## Common mistake

Using only pairwise-independent signs when the analysis needs four-wise independence, which can bias the variance bound.

## 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 job interview answers in real time.