Sliding window questions summary

Fixed size sliding window

• 1456. Maximum Number of Vowels in a Substring of Given Length

• 643. Maximum Average Subarray I

• 567. Permutation in String

• 438. Find All Anagrams in a String

• 219. Contains Duplicate II

Dynamic sliding window

1. numeric constraints: sum, product...

2. character constraints: duplicates, differences, frequency...

Dynamic sliding window--max size substring:

• 3. Longest Substring Without Repeating Characters   【讲解】

• 424. Longest Repeating Character Replacement

• 395. Longest Substring with At Least K Repeating Characters

• 1004. Max Consecutive Ones III

• 1208. Get Equal Substrings Within Budget

Dynamic sliding window--min size substring:

• 209. Minimum Size Subarray Sum

• 76. Minimum Window Substring

• 1658. Minimum Operations to Reduce X to Zero ?

Dynamic sliding window--count valid substrings:

1. 至少满足要求的substrings（as much as good）

• 1358.Number of Substrings Containing All Three Characters   【讲解】

2. 至多满足要求的substrings

• 713. Subarray Product Less Than K

3. substring = target

• 930.Binary Subarrays With Sum