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.
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 | 3843 |
2 | jiangly | 3705 |
3 | Benq | 3628 |
4 | orzdevinwang | 3571 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3530 |
8 | ecnerwala | 3499 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 171 |
2 | awoo | 163 |
3 | adamant | 162 |
4 | TheScrasse | 158 |
5 | nor | 153 |
5 | maroonrk | 153 |
7 | -is-this-fft- | 152 |
8 | Petr | 146 |
9 | orz | 145 |
10 | pajenegod | 144 |
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