How to solve this problem?

#1

i could not get the logic to solve this problem…please help

#2

Hi @pragyachoudhary1111

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.