You are given to Strings , in one String you can swap any adjacent character , also you can swap first and last character . Find the minimum number of swaps required to make two String similar.
Sample Ip —
S1- aab S2- baa
Op — 1
You can swap first and last character of S2 , so ans will be 1.
How to solve this ?
Constraints were 1<=|S1|, |S2| <= 2000.