1. Sliding Window

Contents:

• 1.1. Maximum Sum Subarray of Size K (easy)
• 1.2. Smallest Subarray with a given sum (easy)
• 1.3. Longest Substring with K Distinct Characters (medium)
• 1.4. Fruits into Baskets (medium)
• 1.5. No-repeat Substring (hard)
• 1.6. Longest Substring with Same Letters after Replacement (hard)
• 1.7. Longest Subarray with Ones after Replacement (hard)
• 1.8. Problem Challenge 1 - Permutation in a String (hard)
• 1.9. Problem Challenge 2 - String Anagrams (hard)
• 1.10. Problem Challenge 3 - Smallest Window containing Substring (hard)
• 1.11. Problem Challenge 4 - Words Concatenation (hard)