Tag: sliding-window
- Alternating Groups I
- Alternating Groups II
- Apply Operations to Maximize Frequency Score
- Arithmetic Slices
- Binary Subarrays With Sum
- Constrained Subsequence Sum
- Contains Duplicate II
- Contains Duplicate III
- Continuous Subarrays
- Count Complete Subarrays in an Array
- Count Complete Substrings
- Count Non-Decreasing Subarrays After K Operations
- Count Number of Nice Subarrays
- Count of Sub-Multisets With Bounded Sum
- Count of Substrings Containing Every Vowel and K Consonants I
- Count of Substrings Containing Every Vowel and K Consonants II
- Count Subarrays Where Max Element Appears at Least K Times
- Count Subarrays With Fixed Bounds
- Count Subarrays With Score Less Than K
- Count Substrings That Can Be Rearranged to Contain a String I
- Count Substrings That Can Be Rearranged to Contain a String II
- Count Substrings That Satisfy K-Constraint I
- Count Substrings That Satisfy K-Constraint II
- Count Substrings With K-Frequency Characters I
- Count Substrings With K-Frequency Characters II
- Count Substrings Without Repeating Character
- Count the Number of Good Subarrays
- Count the Number of Substrings With Dominant Ones
- Count Zero Request Servers
- Defuse the Bomb
- Diet Plan Performance
- Distinct Numbers in Each Subarray
- Divide an Array Into Subarrays With Minimum Cost II
- Equalize Strings by Adding or Removing Characters at Ends
- Find All Anagrams in a String
- Find K Closest Elements
- Find K-Length Substrings With No Repeated Characters
- Find Longest Special Substring That Occurs Thrice I
- Find Longest Special Substring That Occurs Thrice II
- Find Pattern in Infinite Stream I
- Find Pattern in Infinite Stream II
- Find Substring With Given Hash Value
- Find the K-Beauty of a Number
- Find the Longest Equal Subarray
- Find the Longest Semi-Repetitive Substring
- Find the Median of the Uniqueness Array
- Find the Power of K-Size Subarrays I
- Find the Power of K-Size Subarrays II
- Find Two Non-overlapping Sub-arrays Each With Target Sum
- Find X-Sum of All K-Long Subarrays I
- Find X-Sum of All K-Long Subarrays II
- Frequency of the Most Frequent Element
- Fruit Into Baskets
- Get Equal Substrings Within Budget
- Grumpy Bookstore Owner
- Jump Game VII
- K Empty Slots
- K Radius Subarray Averages
- Kth Smallest Subarray Sum
- Length of Longest Subarray With at Most K Frequency
- Length of the Longest Valid Substring
- Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit
- Longest Duplicate Substring
- Longest Even Odd Subarray With Threshold
- Longest Harmonious Subsequence
- Longest Nice Subarray
- Longest Nice Substring
- Longest Repeating Character Replacement
- Longest Subarray of 1's After Deleting One Element
- Longest Substring Of All Vowels in Order
- Longest Substring with At Least K Repeating Characters
- Longest Substring with At Most K Distinct Characters
- Longest Substring with At Most Two Distinct Characters
- Longest Substring Without Repeating Characters
- Longest Turbulent Subarray
- Max Consecutive Ones II
- Max Consecutive Ones III
- Max Value of Equation
- Maximize the Confusion of an Exam
- Maximize the Minimum Powered City
- Maximize Win From Two Segments
- Maximum Average Subarray I
- Maximum Beauty of an Array After Applying Operation
- Maximum Coins From K Consecutive Bags
- Maximum Difference Between Even and Odd Frequency II
- Maximum Erasure Value
- Maximum Frequency of an Element After Performing Operations I
- Maximum Frequency of an Element After Performing Operations II
- Maximum Frequency Score of a Subarray
- Maximum Fruits Harvested After At Most K Steps
- Maximum Length of Repeated Subarray
- Maximum Length Substring With Two Occurrences
- Maximum Number of Occurrences of a Substring
- Maximum Number of Robots Within Budget
- Maximum Number of Visible Points
- Maximum Number of Vowels in a Substring of Given Length
- Maximum Points You Can Obtain from Cards
- Maximum Strong Pair XOR I
- Maximum Strong Pair XOR II
- Maximum Subarray With Equal Products
- Maximum Sum of 3 Non-Overlapping Subarrays
- Maximum Sum of Almost Unique Subarray
- Maximum Sum of Distinct Subarrays With Length K
- Maximum Sum of Two Non-Overlapping Subarrays
- Maximum White Tiles Covered by a Carpet
- Minimize Connected Groups by Inserting Interval
- Minimum Adjacent Swaps for K Consecutive Ones
- Minimum Consecutive Cards to Pick Up
- Minimum Difference Between Highest and Lowest of K Scores
- Minimum Moves to Pick K Ones
- Minimum Number of Flips to Make the Binary String Alternating
- Minimum Number of K Consecutive Bit Flips
- Minimum Number of Operations to Make Array Continuous
- Minimum Operations to Make Binary Array Elements Equal to One I
- Minimum Operations to Make Elements Within K Subarrays Equal
- Minimum Operations to Make Subarray Elements Equal
- Minimum Operations to Reduce X to Zero
- Minimum Positive Sum Subarray
- Minimum Recolors to Get K Consecutive Black Blocks
- Minimum Size Subarray in Infinite Array
- Minimum Size Subarray Sum
- Minimum Swaps to Group All 1's Together II
- Minimum Swaps to Group All 1's Together
- Minimum Window Subsequence
- Minimum Window Substring
- New 21 Game
- Number of Equal Count Substrings
- Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold
- Number of Substrings Containing All Three Characters
- Number of Unique Flavors After Sharing K Candies
- Permutation in String
- Repeated DNA Sequences
- Replace the Substring for Balanced String
- Reschedule Meetings for Maximum Free Time I
- Shortest and Lexicographically Smallest Beautiful String
- Shortest Subarray With OR at Least K I
- Shortest Subarray With OR at Least K II
- Shortest Subarray with Sum at Least K
- Sliding Subarray Beauty
- Sliding Window Maximum
- Sliding Window Median
- Smallest Range Covering Elements from K Lists
- Smallest Subarrays With Maximum Bitwise OR
- Subarray Product Less Than K
- Subarrays with K Different Integers
- Substring with Concatenation of All Words
- Substrings of Size Three with Distinct Characters
- Swap For Longest Repeated Character Substring
- Take K of Each Character From Left and Right