Can you give a hint to solve this problem?

#1

Also substring here means continuous substring, right?

#2

@isingh, substrings are always contiguous , subsequences are the one which are not contiguous, coming to this question you can solve this problem in O(n) time using the two pointer approach.

  • 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’.

try to implement this yourself , after trying you can refer :-

#3

I tried referring your code , but I don’t that you have sent is for the particular question I asked. Can you recheck?

#4

*I don’t think the code you have sent is for particular question I asked?

#5

yeah! I have sent you different code link! wait i 'll send u the correct code linj

#6

sorry for this mistake :sweat:, here’s the correct code :-