Sanket And Strings

#1

I’m not able to understand the logic behind it .

#2

Hi @prashant7122
You are not getting desired output because this is not an optimal approach that you are using. Instead you should use the following approach :

This problem can be solved with help of two pointers. Let the first pointer is l and the second pointer is r. Then for every position l we will move right end r until on the substring si.si + 1… sr it is possible to make no more than k swaps to make this substring beautiful. Then we need to update the answer with length of this substring and move l to the right.

First try to solve this ques using this approach. If still you are unable to write code then use the following code. But first give it a try.

#3

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.