Sliding-Window

LeetCode Problem Solving - Sliding Window with Character Frequency

LeetCode Problem Solving

LeetCode Problem Solving

LeetCode Problem Solving - Fixed Size Sliding Window with Sum Calculation

LeetCode 1248 note: “exactly k odd numbers” is not monotonic, so compute “at most k” minus “at most k - 1”; or use prefix sums with a hash map

Fixed-size windows, variable windows for longest / shortest, counting subarrays (at most K minus at most K - 1, count += left for at least K), and monotonic deques for window extremes

LeetCode Problem Solving

LeetCode 187 note: count every length-10 substring in a hash map and return those seen more than once

LeetCode 424 note: a variable sliding window where window length minus the top character count is the number of replacements; shrink when it exceeds k

LeetCode 594 note: subsequences need not be contiguous, so just count; for each x add the counts of x and x + 1

LeetCode 219 note: a hash map stores each value’s last index; only the most recent occurrence needs a distance check