Sliding Window - rFronteddu/general_wiki GitHub Wiki

Monotonic-Deque

• Minimum Size Subarray Sum - Sliding window (two pointers)
• Longest Substring Without Repeating Characters - Sliding window + hash set
• Subarray Product Less Than K - Sliding window *

BEGINNER (Window mechanics)

• Maximum Average Subarray I - Fixed window sum
• Number of Sub-arrays of Size K and Average ≥ Threshold - Fixed window + condition
• Maximum Number of Vowels in a Substring of Given Length - Fixed window + frequency
• Substrings of Size Three with Distinct Characters - Distinct count
• Minimum Difference Between Highest and Lowest of K Scores - Sort + fixed window

INTERMEDIATE (dynamic shrinking, frequency maps, constraints)

• Longest Substring Without Repeating Characters
• Minimum Size Subarray Sum - Shrink-to-valid window
• Fruit Into Baskets - At most 2 distinct
• Max Consecutive Ones III - Replace ≤ K elements
• Longest Repeating Character Replacement - Frequency trick *
• Subarray Product Less Than K - Multiplicative window *
• Permutation in String - Fixed window anagram * (you must use the fixed window approach)
• Find All Anagrams in a String - Frequency matching** (use elegant solution)

ADVANCED (hard, recognize atMost trick, deque, multi-window logic)

• Minimum Window Substring - sliding window
• Sliding Window Maximum - Monotonic deque ** < ----
• Binary Subarrays With Sum - atMost(k) trick **
• Count Number of Nice Subarrays - atMost difference
• Subarrays with K Different Integers
• Longest Substring with At Most Two Distinct Characters - Clean K-distinct logic *