# sliding window

- [395. Longest Substring with At Least K Repeating Characters](/cracking-leetcode/two-pointer/sliding-window/395.-longest-substring-with-at-least-k-repeating-characters.md)
- [1052. Grumpy Bookstore Owner](/cracking-leetcode/two-pointer/sliding-window/1052.-grumpy-bookstore-owner.md)
- [1208. Get Equal Substrings Within Budget](/cracking-leetcode/two-pointer/sliding-window/1208.-get-equal-substrings-within-budget.md)
- [487. Max Consecutive Ones II](/cracking-leetcode/two-pointer/sliding-window/487.-max-consecutive-ones-ii.md)
- [lintcode 604 · Window Sum (basic)](/cracking-leetcode/two-pointer/sliding-window/lintcode-604-window-sum-basic.md)
- [3. Longest Substring Without Repeating Characters](/cracking-leetcode/two-pointer/sliding-window/3.-longest-substring-without-repeating-characters.md): 2598 almost the same
- [340. Longest Substring with At Most K Distinct Characters (sliding window, hashmap, two pointers),](/cracking-leetcode/two-pointer/sliding-window/340.-longest-substring-with-at-most-k-distinct-characters-sliding-window-hashmap-two-pointers.md): 159 is the same to this
- [424. Longest Repeating Character Replacement](/cracking-leetcode/two-pointer/sliding-window/424.-longest-repeating-character-replacement.md)
- [1151. Minimum Swaps to Group All 1's Together](/cracking-leetcode/two-pointer/sliding-window/1151.-minimum-swaps-to-group-all-1s-together.md)
- [2134. Minimum Swaps to Group All 1's Together II](/cracking-leetcode/two-pointer/sliding-window/2134.-minimum-swaps-to-group-all-1s-together-ii.md)
- [1610. Maximum Number of Visible Points](/cracking-leetcode/two-pointer/sliding-window/1610.-maximum-number-of-visible-points.md)
- [76. Minimum Window Substring (sliding window)](/cracking-leetcode/two-pointer/sliding-window/76.-minimum-window-substring-sliding-window.md)
- [567. Permutation in String](/cracking-leetcode/two-pointer/sliding-window/567.-permutation-in-string.md)
- [438. Find All Anagrams in a String](/cracking-leetcode/two-pointer/sliding-window/438.-find-all-anagrams-in-a-string.md)
- [1004. Max Consecutive Ones III](/cracking-leetcode/two-pointer/sliding-window/1004.-max-consecutive-ones-iii.md)
- [1248. Count Number of Nice Subarrays](/cracking-leetcode/two-pointer/sliding-window/1248.-count-number-of-nice-subarrays.md)
- [2516. Take K of Each Character From Left and Right](/cracking-leetcode/two-pointer/sliding-window/2516.-take-k-of-each-character-from-left-and-right.md)
- [424. Longest Repeating Character Replacement (ref to  1004](/cracking-leetcode/two-pointer/sliding-window/424.-longest-repeating-character-replacement-ref-to-1004.md)
- [Page 12](/cracking-leetcode/two-pointer/sliding-window/page-12.md)