| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3408 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 153 |
| 2 | nik_exists | 151 |
| 3 | maroonrk | 150 |
| 4 | maspy | 149 |
| 5 | AmShZ | 146 |
| 6 | Um_nik | 143 |
| 7 | Errichto | 139 |
| 8 | adamant | 135 |
| 9 | BledDest | 134 |
| 10 | cry | 130 |
|
+18
Vladithur is back ) |
|
0
Good job!, I found them very helpful in my learning of Graph algorithms. Can you please update it to detailed version, because I can't understand some of them fully. Sorry for bad english :) |
|
0
My solution may will work because I tried: We will take the first string as S. Create a function for finding the minimum number of swapping to make the string(let's call it st1) palindrome Then you should find all characters that has odd occurrence in S with their indeces. Then remove these all characters only once, so remaining character equal to it will be even or 0. Add number of deletions to the cnt_opr. Then take this changed string as st1(as I mentioned in above function) Then add number of swaps to cnt_opr. I think this will work coz I tested it with some examples but cannot code completely :) |
| Name |
|---|


