📄️ Guidelines
There are three parts to every sliding window problem:
📄️ Permutation in String
Given two strings s1 and s2, return true if s2 contains a permutation of s1, or false otherwise.
📄️ Minimum Size Subarray Sum
Given an array of positive integers nums and a positive integer target, return the minimal length of a subarray whose sum is greater than or equal to target. If there is no such subarray, return 0 instead.
📄️ Fruit Into Baskets
Given the integer array fruits, return the maximum number of fruits you can pick.
📄️ Longest Repeating Character Replacement
Return the length of the longest substring containing the same letter you can get after performing the above operations.
📄️ Longest Substring Without Repeating Characters
Given a string s, find the length of the longest substring without repeating characters.
📄️ Minimum Window Substring
Given two strings s and t of lengths m and n respectively, return the minimum window substring of s such that every character in t (including duplicates) is included in the window.
📄️ Find All Anagrams in a String
Given two strings s and p, return an array of all the start indices of p's anagrams in s. You may return the answer in any order.
📄️ Sliding Window Maximum
You are given an array of integers nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the window.
📄️ Minimum Number of K Consecutive Bit Flips
Return the minimum number of k-bit flips required so that there is no 0 in the array. If it is not possible, return -1.
📄️ Substring with Concatenation of All Words
Return the starting indices of all the concatenated substrings in s. You can return the answer in any order.