Fixed-Size Window Problems
41 Fixed-Size Window problems on LeetCode, a Sliding Window interview pattern, ranked by importance (how often it comes up in real interviews). Difficulty (ELO) and importance shown per problem.
| # | PROBLEM | DIFF | ELO | IMP | PATTERNS |
|---|---|---|---|---|---|
| 1 | Find All Anagrams in a String | Easy | 1358 | 86 | Frequency Counting / Hash Map Lookup |
| 2 | Permutation in String | Easy | 1368 | 86 | Frequency Counting / Hash Map Lookup |
| 3 | Distinct Numbers in Each SubarrayPREMIUM | Easy | 1282 | 78 | Frequency Counting / Hash Map Lookup |
| 4 | Maximum Average Subarray I | Easy | 1107 | 72 | Prefix Sums |
| 5 | Maximum Number of Vowels in a Substring of Given Length | Easy | 1263 | 72 |
MORE SLIDING WINDOW PATTERNS
// your mastery





What's your Fixed-Size Window tier?
leaps.gg syncs your LeetCode history, scores your Fixed-Size Window mastery, and recommends exactly which problems to do next with spaced repetition. Free to start.
GET MY MASTERY MAP →