Tags
- β = solved in first try
- π = revisit
- π₯ = important
- β οΈ = solved but edge case missed
- π = solved but had to see little soluation first
- π = out of the box
- no tag = pending/not started
1. Pattern: Sliding Window
1.1 Fixed Size Sliding Window
| Question | Tags | Remember | My Soluation |
|---|---|---|---|
| 1. Maximum Sum Subarray of Size K (easy) | β | 0. Questions | |
| 2. Permutation in String (medium) | ππ | Is one string a permutation of another? just compare frequencies, you donβt need to generate all permutations. | |
| 3. Find All Anagrams in a String (medium) | β | ||
| 5. Maximum Number of Vowels in a Substring of Given Length (medium) | β | ||
| 6. Maximum Sum of Distinct Subarrays With Length K (medium) | π₯β | ||
| 7. Maximum Number of Occurrences of a Substring (medium) | β | ||
| 8. Substring with Concatenation of All Words (hard) | ππ | wasted 2-3 hr β need to revisit. |
1.2 Dynamic Size Sliding Window
| Question | Tags | Remember | My Soluation |
|---|---|---|---|
| 1. Minimum Size Subarray Sum (medium) | β | ||
| 2. Fruit Into Baskets (medium) | β | ||
| 3. Max Consecutive Ones III (medium) | β | ||
| 4. Minimum Size Subarray Sum (medium) | β | ||
| 5. Longest Substring Without Repeating Characters (medium) | β | ||
| 6. Longest K Unique Characters Substring (medium) | |||
| 7. Longest Repeating Character Replacement (hard) | |||
| 8. Subarray Product Less Than K (medium) | |||
| 9. Minimum Window Substring (hard) |