https://ide.codingblocks.com/s/332030 I maintai count of a and b and then print my output acc to wether count of a is larger or count of b compared to the maximum conversion that we can have.
Wht are alll the test cases failing
hello @pranjuldwivedi120568
your approach is not correct.
To solve this problem use 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’.
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.