Meet your coaches
Talk through the problem while you code. Guest text is free. Hosted voice is the Own Words Pack.
Start Part 1 to unlock your next challenge
Sliding Window Maximum
This problem is a great test of whether you can keep window state consistent as it moves. It's a hard one for a reason: it stresses stateful scanning when the rules pile up. Be disciplined about counts and boundaries; most bugs are off-by-one window moves.
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 sessionMeet your coaches
Talk through the problem while you code. Guest text is free. Hosted voice is the Own Words Pack.
Start a coached rep now. Guest text is free. Sign in if you want this work on another device.
Email me this coached-rep link
Start Part 1 to unlock your next challenge
Code + tests need a desktop
Chat works on this phone. Email yourself a link when you want the editor and tests.