Practice Problems

Fixed Size Window:

• Maximum Sum of a Subarray of Size K
• Minimize the Maximum of Two Arrays
• Longest Substring with K Distinct Characters
• Longest Repeating Character Replacement
• Sliding Window Maximum

Variable Size Window:

• Minimum Size Subarray Sum
• Longest Substring Without Repeating Characters
• Find All Anagrams in a String
• Permutation in String
• Fruit Into Baskets

Advanced Problems:

• Count Number of Nice Subarrays
• Subarrays with K Different Integers
• Number of Subarrays with At Least K Ones
• Longest Substring with At Most K Distinct Characters

Additional Problems:

• K Concatenation Maximum Sum
• Count Subarrays with Fixed Bounds
• Maximum Erasure Value

Challenges:

• Minimum Window Substring
• Subarray Product Less Than K