Maximum Sub-String after at most K changes
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.

Example 1:

Input: s = "ABAB", k = 2
Output: 4
Explanation: Change 2 'B' into 'A'.


Input: s = "ABCD", k = 1
Output: 2
Explanation: Change one 'B' into 'A'.


Your Task:
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)


1 <= n <= 104

We are replacing the old Disqus forum with the new Discussions section given below.
Click here to view old Disqus comments.

to report an issue on this page.


We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?


All Submissions

My Submissions:

Login to access your submissions.

Maximum Sub-String after at most K changes

Output Window