# Longest Repeating Character Replacement: Explained

Longest Repeating Character Replacement shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Window [l,r] is valid when (r-l+1) - maxFreq <= k. Expand right, and shrink left when too many replacements would be needed.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (two pointers, a sliding window, prefix sums, a monotonic stack, or binary search on the answer) and why a linear nested scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n).

## Common mistake

Recomputing the max frequency from scratch every time instead of tracking it as counts change.

## 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 www.linkjob.ai.