You are given a string s of uppercase letters and an integer k. You may replace at most k characters of s, each with any uppercase letter you choose. Find the length of the longest contiguous substring that can be made to consist of a single repeated character after performing at most k replacements.
Input format
Line 1: the string s (possibly empty) of uppercase letters A-Z.
Line 2: the integer k.
Output format
A single integer: the length of the longest achievable uniform substring.
Constraints
- 0 <= length of
s<= 100000 - 0 <= k <= length of
s