Longest repeat after k replacements
Mediumstringsliding windowhash map
You may change up to k letters of s into any other letter. Return the length of the longest contiguous part that can be made of one repeated letter.
Example 1
Input: s = "ABAB", k = 2 Output: 4
Example 2
Input: s = "AABABBA", k = 1 Output: 4
Constraints
- 1 ≤ s.length ≤ 10⁵
- Uppercase letters
- 0 ≤ k ≤ s.length
Submit checks your solution against 9 tests, including hidden ones.
/**
* @param {string} s
* @param {int} k
* @return {int}
*/
function characterReplacement(s, k) {
}