Sanket and strings

#1

please explain the algo of two pointers with an example

#2

@Faizan-Ali-1395131367301898 hey faizan . 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.

#3

Bro explan with an example by taking numbers