# Maximum Equal Frequency: Study Guide

Maximum Equal Frequency shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Delete at most one element so that every remaining value has the same frequency. Walk left to right, tracking value frequencies and a map count[f] = how many values have frequency f, plus the max frequency. After each prefix, the array is valid if (1) all frequencies are 1, (2) one value has freq 1 and the rest share a frequency, or (3) one value has freq = maxF and appears once while others have maxF-1. Record the longest such prefix.

## 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

Only checking the whole array instead of every prefix (the answer is a prefix length) or mishandling the 'all unique' case.

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