https://leetcode.com/problems/get-equal-substrings-within-budget/description/

Max substring sum(abs(s[..] - t[..])) < maxCost #medium #sliding_window

https://leetcode.com/problems/grumpy-bookstore-owner/description/

Max customers sum after make consecutive minutes non-grumpy #medium #sliding_window

https://leetcode.com/problems/count-number-of-nice-subarrays/description/

Count subarrays with k odds #medium #sliding_window

https://leetcode.com/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit/description/

Longest subarray with abs(a[i] - a[j]) <= limit #medium #sliding_window #monotonic_queue

https://leetcode.com/problems/minimum-number-of-k-consecutive-bit-flips/description/

Count k-range flips in binary array to make all 1 #hard #sliding_window

https://leetcode.com/problems/minimum-difference-between-largest-and-smallest-value-in-three-moves/description/

Min difference after 3 changes in array #medium #sliding_window #dynamic_programming

https://leetcode.com/problems/minimum-swaps-to-group-all-1s-together-ii/description/

Min swaps to make a circular [01] array #medium #sliding_window

https://leetcode.com/problems/shortest-subarray-with-or-at-least-k-ii/description/


Min subarray with OR[..] >= k #medium #bit_manipulation #sliding_window

https://leetcode.com/problems/find-the-power-of-k-size-subarrays-i/description/

Tops of consecutive increasing windows #medium #sliding_window

https://leetcode.com/problems/defuse-the-bomb/description/


Next +-k window sums #easy #sliding_window

https://leetcode.com/problems/maximum-sum-of-distinct-subarrays-with-length-k/description/


Max k-unique window sum #medium #sliding_window