## Sliding Window

| \# | 题名 | 题解 | 通过率 | 难度 | 出现频率   |
|------|----------------------|-----|--------|----|--------|
|3|[无重复字符的最长子串](https://leetcode-cn.com/problems/longest-substring-without-repeating-characters)   |[626](https://leetcode-cn.com/problems/longest-substring-without-repeating-characters/solution)|32.3%|中等|59.24%|
|480|[滑动窗口中位数](https://leetcode-cn.com/problems/sliding-window-median)   |[9](https://leetcode-cn.com/problems/sliding-window-median/solution)|33.1%|困难|47.81%|
|76|[最小覆盖子串](https://leetcode-cn.com/problems/minimum-window-substring)   |[47](https://leetcode-cn.com/problems/minimum-window-substring/solution)|34.8%|困难|41.93%|
|1074|[元素和为目标值的子矩阵数量](https://leetcode-cn.com/problems/number-of-submatrices-that-sum-to-target)   |[9](https://leetcode-cn.com/problems/number-of-submatrices-that-sum-to-target/solution)|39.6%|困难|38.84%|
|424|[替换后的最长重复字符](https://leetcode-cn.com/problems/longest-repeating-character-replacement)   |[11](https://leetcode-cn.com/problems/longest-repeating-character-replacement/solution)|44.6%|中等|31.64%|
|1004|[最大连续1的个数 III](https://leetcode-cn.com/problems/max-consecutive-ones-iii)   |[17](https://leetcode-cn.com/problems/max-consecutive-ones-iii/solution)|46.2%|中等|30.95%|
|992|[K 个不同整数的子数组](https://leetcode-cn.com/problems/subarrays-with-k-different-integers)   |[15](https://leetcode-cn.com/problems/subarrays-with-k-different-integers/solution)|23.6%|困难|30.41%|
|239|[滑动窗口最大值](https://leetcode-cn.com/problems/sliding-window-maximum)   |[80](https://leetcode-cn.com/problems/sliding-window-maximum/solution)|43.2%|困难|28.85%|
|1040|[移动石子直到连续 II](https://leetcode-cn.com/problems/moving-stones-until-consecutive-ii)   |[7](https://leetcode-cn.com/problems/moving-stones-until-consecutive-ii/solution)|43.9%|中等|28.24%|
|1176|[健身计划评估](https://leetcode-cn.com/problems/diet-plan-performance)   |[19](https://leetcode-cn.com/problems/diet-plan-performance/solution)|39.0%|简单|25.32%|
|1151|[最少交换次数来组合所有的 1](https://leetcode-cn.com/problems/minimum-swaps-to-group-all-1s-together)   |[6](https://leetcode-cn.com/problems/minimum-swaps-to-group-all-1s-together/solution)|38.8%|中等|17.21%|
|340|[至多包含 K 个不同字符的最长子串](https://leetcode-cn.com/problems/longest-substring-with-at-most-k-distinct-characters)   |[15](https://leetcode-cn.com/problems/longest-substring-with-at-most-k-distinct-characters/solution)|45.1%|困难|16.38%|
|159|[至多包含两个不同字符的最长子串](https://leetcode-cn.com/problems/longest-substring-with-at-most-two-distinct-characters)   |[16](https://leetcode-cn.com/problems/longest-substring-with-at-most-two-distinct-characters/solution)|52.1%|中等|16.03%|
|978|[最长湍流子数组](https://leetcode-cn.com/problems/longest-turbulent-subarray)   |[16](https://leetcode-cn.com/problems/longest-turbulent-subarray/solution)|36.8%|中等|14.72%|
|1052|[爱生气的书店老板](https://leetcode-cn.com/problems/grumpy-bookstore-owner)   |[21](https://leetcode-cn.com/problems/grumpy-bookstore-owner/solution)|45.1%|中等|12.69%|
|567|[字符串的排列](https://leetcode-cn.com/problems/permutation-in-string)   |[39](https://leetcode-cn.com/problems/permutation-in-string/solution)|33.2%|中等|11.42%|
|1208|[尽可能使字符串相等](https://leetcode-cn.com/problems/get-equal-substrings-within-budget)   |[22](https://leetcode-cn.com/problems/get-equal-substrings-within-budget/solution)|29.1%|中等|10.91%|
|1100|[长度为 K 的无重复字符子串](https://leetcode-cn.com/problems/find-k-length-substrings-with-no-repeated-characters)   |[7](https://leetcode-cn.com/problems/find-k-length-substrings-with-no-repeated-characters/solution)|60.8%|中等|&nbsp;|
|995|[K 连续位的最小翻转次数](https://leetcode-cn.com/problems/minimum-number-of-k-consecutive-bit-flips)   |[9](https://leetcode-cn.com/problems/minimum-number-of-k-consecutive-bit-flips/solution)|37.9%|困难|&nbsp;|
|727|[最小窗口子序列](https://leetcode-cn.com/problems/minimum-window-subsequence)   |[9](https://leetcode-cn.com/problems/minimum-window-subsequence/solution)|39.1%|困难|&nbsp;|


