Medium Accuracy: 49.19%
Submissions: 427 Points: 4
We have a string s of length n, which consist only UPPERCASE characters and we have a number k (always less than n and greater than 0). We can make at most k changes in our string such that we can get a sub-string of maximum length which have all same characters.
Input: s = "ABAB", k = 2
Explanation: Change 2 'B' into 'A'.
Input: s = "ABCD", k = 1
Explanation: Change one 'B' into 'A'.
You don't need to read print anything. Your task is to complete the function characterReplacement() which takes s and k as input parameter and returns the maximum length of sub-string after doing k changes.
Expected Time Complexity: O(n) Expected Space Complexity: O(26)