Given two strings, what is the best method to find the longest common palindromic substring?
This problem was asked in a local programming competition in my city, constraints were not specified.
# | User | Rating |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3741 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3489 |
7 | Radewoosh | 3483 |
8 | Kevin114514 | 3443 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 158 |
5 | -is-this-fft- | 158 |
7 | awoo | 156 |
8 | djm03178 | 155 |
9 | TheScrasse | 154 |
10 | Dominater069 | 153 |
Given two strings, what is the best method to find the longest common palindromic substring?
This problem was asked in a local programming competition in my city, constraints were not specified.
Name |
---|
Manacher's algorithm. Also you can use hashes + binary search or suffix structures.
We can do it in O(N*logN), you can find it here