can you please provide the logic to solve such problems
SanketAndStrings
HI @Shubham_helloworld
You can look for the following Approach:
Perform following for both the characters a and b individually,
Take two pointers 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(length of the string)
3.1. increase the count whenever you find a different character(by different we mean if we are forming a string of a 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.
Hope, this would help.
u can refer to dis code for more help