You are given a string S consistiung of characters '0' to '9'.
you can do the following opeartion on th string at most k times
operation = Swap any two elements of the string.
Task
Determine the maximum longest substring of the same element.
Note: 1-based indexing is allowed.
constraints
1<|s|<2*10^3
1<k<100
sample input
k= 2
s = 00101001010
Ouput
7