What is the issue with this code

#1

This is working fine on ide

#2
#3

hello @hemantomer1
check ur code for this->
0
bababaaa

#4

The o/p is coming as 5

#5

that is not correct.
in question it is asked about substring (ie all character should be contigous)

try to think of two pointer approach.

2 Likes
#6

How to implement that

#7

get the laaksonen competitive programming hadbook, it will be great help!
it includes what a two pointer techniques are!!
for the time being you refer this…

#8

for this problem ->

  • Make two variabes , say i and j .
  • i defines the beginning of a window and j defines its end.
  • Start i from 0 and j from k.
  • Let’s talk about the singular case when we are considering the max window for only 'a’s and consider only the swapping of b-> a. If we are able to get the answer for max window of consecutive 'a’s , we can simply implement the same algo for the max ‘b’ window as well.
  • So we started i from 0 and j from k.
  • Move j ahead freely as long as there are ‘a’ characters at s[ j ] position.
  • Maintain a count variable which counts the number of swaps made or the number of 'b’s in our A window.
  • If you encounter a ‘b’ char at s[ j ] position , increment the count variable. Count should never exceed k .
  • Take the size of the window at every point using length = j - i + 1;
  • Compute the max size window this way and do the same for ‘b’ as well.
  • Output the maximum size window of ‘a’ and ‘b’.

implementation->

1 Like
#9

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.