# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | awoo | 158 |
4 | cry | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | maroonrk | 152 |
Name |
---|
https://codeforces.net/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.net/contest/1326/problem/D2