# Sliding Window Pattern

- [Shortest Subarray with Sum at Least K (Leetcode 862) \[To be done\]](/dsa-in-python/sliding-window-pattern/shortest-subarray-with-sum-at-least-k-leetcode-862-to-be-done.md)
- [Replace the Substring for Balanced String (Leetcode 1234) \[To be done\]](/dsa-in-python/sliding-window-pattern/replace-the-substring-for-balanced-string-leetcode-1234-to-be-done.md)
- [Substring with Concatenation of All Words (Leetcode 30) \[To be done\]](/dsa-in-python/sliding-window-pattern/substring-with-concatenation-of-all-words-leetcode-30-to-be-done.md)
- [Minimum Window Substring (Leetcode 76) \[To be done\]](/dsa-in-python/sliding-window-pattern/minimum-window-substring-leetcode-76-to-be-done.md)
- [Fixed Size Sliding Window Pattern](/dsa-in-python/sliding-window-pattern/fixed-size-sliding-window-pattern.md)
- [Max Sum Subarray of size K](/dsa-in-python/sliding-window-pattern/fixed-size-sliding-window-pattern/max-sum-subarray-of-size-k.md)
- [Minimum Swaps and K Together](/dsa-in-python/sliding-window-pattern/fixed-size-sliding-window-pattern/minimum-swaps-and-k-together.md)
- [First negative integer in every window of size k](/dsa-in-python/sliding-window-pattern/fixed-size-sliding-window-pattern/first-negative-integer-in-every-window-of-size-k.md)
- [Substrings of Size Three with Distinct Characters (Leetcode 1876)](/dsa-in-python/sliding-window-pattern/fixed-size-sliding-window-pattern/substrings-of-size-three-with-distinct-characters-leetcode-1876.md)
- [Find the K-Beauty of a Number (Leetcode 2269)](/dsa-in-python/sliding-window-pattern/fixed-size-sliding-window-pattern/find-the-k-beauty-of-a-number-leetcode-2269.md)
- [Maximum Average Subarray I (Leetcode 643)](/dsa-in-python/sliding-window-pattern/fixed-size-sliding-window-pattern/maximum-average-subarray-i-leetcode-643.md)
- [Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold (Leetcode 1343)](/dsa-in-python/sliding-window-pattern/fixed-size-sliding-window-pattern/number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold-leetcode-1343.md)
- [Find All Anagrams in a String (Leetcode 438)](/dsa-in-python/sliding-window-pattern/fixed-size-sliding-window-pattern/find-all-anagrams-in-a-string-leetcode-438.md)
- [Permutation in String (Leetcode 567)](/dsa-in-python/sliding-window-pattern/fixed-size-sliding-window-pattern/permutation-in-string-leetcode-567.md)
- [Minimum Recolors to Get K Consecutive Black Blocks (Leetcode 2379)](/dsa-in-python/sliding-window-pattern/fixed-size-sliding-window-pattern/minimum-recolors-to-get-k-consecutive-black-blocks-leetcode-2379.md)
- [Maximum Points You Can Obtain from Cards (Leetcode 1423)](/dsa-in-python/sliding-window-pattern/fixed-size-sliding-window-pattern/maximum-points-you-can-obtain-from-cards-leetcode-1423.md)
- [Minimum Difference Between Largest and Smallest Value in Three Moves (Leetcode 1509)](/dsa-in-python/sliding-window-pattern/fixed-size-sliding-window-pattern/minimum-difference-between-largest-and-smallest-value-in-three-moves-leetcode-1509.md)
- [\*\*\*Sliding Window Maximum (Leetcode 239)](/dsa-in-python/sliding-window-pattern/fixed-size-sliding-window-pattern/sliding-window-maximum-leetcode-239.md): Very Important Question. Understand how deque is used here
- [Variable Size Sliding Window Pattern](/dsa-in-python/sliding-window-pattern/variable-size-sliding-window-pattern.md)
- [Minimum Size Subarray Sum (Leetcode 209)](/dsa-in-python/sliding-window-pattern/variable-size-sliding-window-pattern/minimum-size-subarray-sum-leetcode-209.md)
- [Array Removals](/dsa-in-python/sliding-window-pattern/variable-size-sliding-window-pattern/array-removals.md)
- [Longest Substring Without Repeating Characters (Leetcode 3)](/dsa-in-python/sliding-window-pattern/variable-size-sliding-window-pattern/longest-substring-without-repeating-characters-leetcode-3.md)
- [Longest K unique characters substring](/dsa-in-python/sliding-window-pattern/variable-size-sliding-window-pattern/longest-k-unique-characters-substring.md)
- [\*\*\*Longest Repeating Character Replacement (Leetcode 424)](/dsa-in-python/sliding-window-pattern/variable-size-sliding-window-pattern/longest-repeating-character-replacement-leetcode-424.md)
- [Maximum Consecutive Ones Pattern (ATMOST pattern)](/dsa-in-python/sliding-window-pattern/maximum-consecutive-ones-pattern-atmost-pattern.md): This page contains all the questions of this pattern
- [\*\*\*Max Consecutive Ones (Leetcode 485)](/dsa-in-python/sliding-window-pattern/maximum-consecutive-ones-pattern-atmost-pattern/max-consecutive-ones-leetcode-485.md)
- [\*\*\*Max Consecutive Ones II](/dsa-in-python/sliding-window-pattern/maximum-consecutive-ones-pattern-atmost-pattern/max-consecutive-ones-ii.md)
- [\*\*\*Max Consecutive Ones III (Leetcode 1004)](/dsa-in-python/sliding-window-pattern/maximum-consecutive-ones-pattern-atmost-pattern/max-consecutive-ones-iii-leetcode-1004.md)
- [\*\*\*Longest Subarray of 1's After Deleting One Element (Leetcode 1493)](/dsa-in-python/sliding-window-pattern/maximum-consecutive-ones-pattern-atmost-pattern/longest-subarray-of-1s-after-deleting-one-element-leetcode-1493.md)
- [Fruit Into Baskets (Leetcode 904)](/dsa-in-python/sliding-window-pattern/maximum-consecutive-ones-pattern-atmost-pattern/fruit-into-baskets-leetcode-904.md)
- [Longest Substring with atmost two distinct characters](/dsa-in-python/sliding-window-pattern/maximum-consecutive-ones-pattern-atmost-pattern/longest-substring-with-atmost-two-distinct-characters.md)
- [Longest Substring with At Most K Distinct Characters](/dsa-in-python/sliding-window-pattern/maximum-consecutive-ones-pattern-atmost-pattern/longest-substring-with-at-most-k-distinct-characters.md)
- [Exactly K pattern](/dsa-in-python/sliding-window-pattern/exactly-k-pattern.md)
- [Binary Subarrays with Sum(Leetcode 930)](/dsa-in-python/sliding-window-pattern/exactly-k-pattern/binary-subarrays-with-sum-leetcode-930.md)
- [Subarrays with K Different Integers (Leetcode 992)](/dsa-in-python/sliding-window-pattern/exactly-k-pattern/subarrays-with-k-different-integers-leetcode-992.md)
- [Number of Substrings Containing All Three Characters (Leetcode 1358)](/dsa-in-python/sliding-window-pattern/exactly-k-pattern/number-of-substrings-containing-all-three-characters-leetcode-1358.md)
- [Minimum Difference Between Highest and Lowest of K Scores (Leetcode 1984)](/dsa-in-python/sliding-window-pattern/minimum-difference-between-highest-and-lowest-of-k-scores-leetcode-1984.md)
- [\*\*\* Longest Nice Substring (Leetcode 1763)](/dsa-in-python/sliding-window-pattern/longest-nice-substring-leetcode-1763.md): Tags: Sliding window, Divide and Conquer, Recursion
- [Contains Duplicate II (Leetcode 219)](/dsa-in-python/sliding-window-pattern/contains-duplicate-ii-leetcode-219.md)
- [Longest Substring with At Least K Repeating Characters (Leetcode 395)](/dsa-in-python/sliding-window-pattern/longest-substring-with-at-least-k-repeating-characters-leetcode-395.md)
- [Length of the Longest Alphabetical Continuous Substring(Leetcode 2414)](/dsa-in-python/sliding-window-pattern/length-of-the-longest-alphabetical-continuous-substring-leetcode-2414.md)
- [Count Number of Nice Subarrays (Leetcode 1248)](/dsa-in-python/sliding-window-pattern/count-number-of-nice-subarrays-leetcode-1248.md)
