Sliding Window

There are exactly two window templates. Decide first: is the window size fixed or variable? Everything else follows.

Expand the window until the sum is large enough, then shrink from the left to minimize length while the sum stays valid.

Maintain a fixed window of size k, slide by adding/removing one element at a time

Maintain a window of k elements using a HashSet to detect duplicates. Problem walkthrough from the Sliding Window pattern set — Java templates, complexity…

Expand the right edge of the window; track how many zeros are inside; when zeros exceed k, shrink from the left until valid again. The maximum window length…