Sliding Window: DSA Learning Path

Optimize subarray and substring problems with windows

Every problem below runs in an in-browser editor with auto-judging and step-wise AI hints. Free, no signup needed to start.

Sliding Window Foundations

The basics you need before the Sliding Window problems, explained from scratch

• Sliding Window Foundations Foundation

Sliding Window Techniques

Master window-based algorithms for contiguous sequences

• Maximum Subarray Sum of Size K Easy
• Longest Substring Without Repeating Medium
• Longest Repeating Character Replacement Medium
• Permutation in String Medium
• Minimum Window Substring Hard
• Sliding Window Maximum Hard

All DSA learning paths