Skip to main content
mediumBlind 75

Longest Repeating Character Replacement

The window is valid while its length minus its most frequent count stays within k. I grow, then shrink only when that breaks.

Arrays & HashingStringTwo PointersSliding Window

Learn this pattern

Sliding Window Algorithm

Sliding window processes arrays or strings by moving a window through the data, updating results incrementally instead of recalculating from scratch. Reach for it when you see "contiguous subarray," "longest/shortest substring," or "at most K distinct."

Chat with Fin or Coco right now on mobile.

Start talking through the problem here. Switch to desktop when you're ready to code and run tests.

Start coaching session
Coco
Fin

Meet your coaches

Talk through the problem while you code. Guest text is free. Hosted voice is the Own Words Pack.

1Find Longest Substring with K Replacementsmedium
Based onLeetCode

Code + tests need a desktop

Chat works on this phone. Email yourself a link when you want the editor and tests.