Sliding Window

Summary

A technique for efficiently processing contiguous subarrays/substrings by maintaining a moving window instead of recomputing from scratch — turns many O(n²) problems into O(n).

• 1Practice fixed-size and variable-size sliding window problems.
• 2Learn to identify sliding-window-shaped problems from the phrase 'contiguous subarray/substring.'
• 3Solve a few classics: longest substring without repeats, max sum subarray of size k.