Sliding Window Problems

Practise 30 sliding window problems from basics to advanced in Python, C++, Java, JavaScript and TypeScript.

This track covers fixed and variable windows, counting windows that meet a condition, and windows with a hash map or a monotonic deque. The problems run from easy to hard, so each idea builds on the one before. Every problem is judged against hidden test cases in five languages.

What you will practise:

• Basics: 10 easy problems such as Best Window Total, Circular Code Sums and Ring Window Best.
• Core Problems: 14 medium problems such as Exactly K Odd, All Three Present and Distinct Pieces of Length K.
• Hard Problems: 6 hard problems such as Smallest Covering Window, Shortest Stretch Reaching K and Best Equation Value.

Start with the basics, move on to the core problems, and try the hard ones when the pattern feels natural. Every problem comes with worked examples and clear constraints. For a full path across all of DSA, see Revquix 80, Revquix 150 and Revquix 300.