| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 166 |
| 2 | maomao90 | 163 |
| 2 | Um_nik | 163 |
| 4 | atcoder_official | 161 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | nor | 153 |
| 9 | Dominater069 | 153 |
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.
Can anyone please help ?
I want to help, but seems like I can't find a solution myself. So I just upvoted your post. Haha.
All those upvotes on your post probably means, "Good question Mate. I want to know the solution too!"
Don't reply to my comment right now. Wait till the post drowns down in few days. Comment then and it will pop up again at top. Keep repeating this until some smart person comments the solution :p
Anyone can help ?