# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3821 |
3 | Benq | 3736 |
4 | Radewoosh | 3631 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3388 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 161 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
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