There is a string s of length n , we have to find the maximum length x such that all substrings L of length x has at most k distinct characters.

constraint- n<=10^5