# Find The Longest Equal Subarray: Interview Notes

Find The Longest Equal Subarray shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

You may delete at most k elements so that a remaining contiguous-after-deletion subarray is all equal. For each value, collect its indices and slide a window where (window_span - count) <= k; maximize count.

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

Treating the remaining elements as a subsequence that need not come from a single original window, or using one global sliding window instead of per-value index lists.

## 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 this tool.