Test cases not passed
Hey @shubhamhalder0 your approach in which you are making all first k characters equal is incorrect. Please try to think to think of an alternative solution.
Hint: Use a sliding window to solve this question.
what kind of sliding window?
Take two-pointer l and r to mark the left and right index of the string under consideration.
starting from l=0,r=0,max=0,count=0.
repeat until r <n
3.1. increase the count whenever you find a different character(by different we mean if we are forming a string of an only, then b is different).
3.2. while count is greater than k,
3.2.1. decrement the count by one if the element at lth index is different.
3.2.1. increment l.
3.3. Compare max with count for maximum value.
3.4. increment r.
left act as left pointer and i as right pointer
where did n come from?
n is your string length
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.
I’m unable to understand please kindly share code
Please check this code link