1. Pattern: Sliding Window

• Maximum Sum Subarray of Size K (easy)
• Smallest Subarray with a given sum (easy)
• Longest Substring with K Distinct Characters (medium)
• Fruits into Baskets (medium)
• No-repeat Substring (hard) *
• Longest Substring with Same Letters after Replacement (hard)
• Longest Subarray with Ones after Replacement (hard) *
• Problem Challenge 1 - Permutation in a String (hard) *
• Problem Challenge 2 - String Anagrams (hard)
• Problem Challenge 3 - Smallest Window containing Substring (hard) *
• Problem Challenge 4 - Words Concatenation (hard)

[Pattern 1: Sliding Window](https://gunaland95.notion.site/Pattern-1-Sliding-Window-10761988b14a41b7860f744a17e076ef)

2. Pattern: Two Pointers

• Pair with Target Sum (easy)
• Remove Duplicates (easy)