I want an approach to solve these kind of problems

#1

I couldn’t solve these type of problems. Can you give me a hint or reference for this problem?

#2

hello @gvspraveen113

here u need to find the maximum length of a substring (consecutive subsequence) consisting of equal letters. and u are allowed to change no more than k characters of the original string.

for example->
4 2
abba

answer is 4 becuase can obtain both strings “aaaa”(by change 2 b’s into a) and “bbbb”(changing a’ to b)

8 1
aabaabaa
answer is 5 becuase we can obtain string “aaaaabaa” or string “aabaaaaa”. (both have 5 length substring with all smae character)

hint -> two pointers

#3

https://ide.codingblocks.com/s/480998 It run fine on all test cases but on input (1 aabbbaaaba) its giving output as 3 whereas the output must be 5 as per calculation .Can you help me find the bug in my code or logic

#4

above implementation is incorrect
pls check this ->

#5

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.