Opening page…
Growing and shrinking a contiguous window to answer subarray and substring questions in one pass.
Solved
| Solved | # | Problem | Pattern | Level | Preview |
|---|---|---|---|---|---|
| 1 | Maximum Average Subarray I | fixed window | Easy | ||
| 2 | Contains Duplicate II | fixed window · hash set | Easy | ||
| 3 | Longest Substring Without Repeating Characters | variable window · hash map | Medium | ||
| 4 | Longest Repeating Character Replacement | variable window · frequency count | Medium | ||
| 5 | Permutation in String | fixed window · frequency count | Medium | ||
| 6 | Max Consecutive Ones III | variable window | Medium | ||
| 7 | Minimum Window Substring | variable window · frequency count | Hard | ||
| 8 | Subarrays with K Different Integers | variable window · at-most trick | Hard |
Showing 1–8 of 8 problems