Sanket has a string consisting of only a and b as the characters. Sanket describes perfectness of a string as the maximum length substring of equal characters. Sanket is given a number K which denotes the maximum number of characters he can change. Find the maximum perfectness he can generate by swapping no more than k characters
Sir, I am not able to understand the question
You are given a string consisting of a and b only…you have to find the maximum length of substring having equal characters(either a or b) that you can achieve after changing no more than k characters in the original string.
Hey Raushan,
As you are not responding to this thread, I am marking your doubt as Resolved for now. Re-open it if required.
Please mark your doubts as resolved in your course’s “ Ask Doubt ” section, when your doubt is resolved.