I found these good sliding window problems on Techie Delight. Can anyone suggest few more problems that can be solved with sliding window technique? I would be very interested in solving a few more…

Find the longest substring of given string containing k distinct characters

Find all substrings of a string that are permutation of a given string

Longest substring of given string containing distinct characters

Find maximum length sequence of continuous ones (Using Sliding Window)

Find the maximum sequence of continuous 1’s that can be formed by replacing atmost k zeroes by ones

Find the length of smallest subarray whose sum of elements is greater than the given number

Find count of distinct elements in every subarray of size k
Thanks.