Sanket and strings

#1

i am not getting the approach to the question

#2

Hi @Anushi_Agarwal
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. Try to code yourself but it you are struck somewhere then have a look at the code below :

If your doubt is clear then mark it as resolved.

#3

Hey @Aayush can you please add detailed comments to this code of yours?

Thank you.