| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 134 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
| Name |
|---|



https://codeforces.me/contest/1080/problem/E
Thanks a lot man :).
https://csacademy.com/contest/archive/task/palindromic-friendship
https://www.codechef.com/problems/PALIN3
https://leetcode.com/problems/longest-palindromic-substring
Thank you :)
https://www.spoj.com/problems/EPALIN/
This is a very simply formulated but tough problem, where Manacher's algorithm is the first (easy) half of the problem:
https://open.kattis.com/problems/palindromes
But it is good for practicing your palindrome thinking. It took me two weeks to come up with a solution a couple of years ago :)
New problem: https://codeforces.me/contest/1326/problem/D2