| # | User | Rating |
|---|---|---|
| 1 | jiangly | 3846 |
| 2 | tourist | 3799 |
| 3 | orzdevinwang | 3706 |
| 4 | jqdai0815 | 3682 |
| 5 | ksun48 | 3590 |
| 6 | Ormlis | 3533 |
| 7 | Benq | 3468 |
| 8 | Radewoosh | 3463 |
| 9 | ecnerwala | 3451 |
| 9 | Um_nik | 3451 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 165 |
| 2 | -is-this-fft- | 161 |
| 3 | Qingyu | 160 |
| 4 | atcoder_official | 157 |
| 5 | Dominater069 | 156 |
| 6 | adamant | 154 |
| 7 | Um_nik | 151 |
| 7 | djm03178 | 151 |
| 9 | luogu_official | 149 |
| 10 | awoo | 147 |
Longest Palindromic Substring in Linear Time with Hashing in Linear Time and Constant Extra Space
Many sources note that Longest Palindromic Substring (LPS) can be solved in linearithmic time using hashing and binary search.
Surprisingly, I have not found any sources claiming that LPS can be solved in linear time with hashing, despite such an algorithm being possible and elementary. We'll introduce such an algorithm
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en8 |
|
dajeff | 2025-03-12 10:43:41 | 0 | (published) | |
| en7 |
|
dajeff | 2025-03-12 10:43:07 | 224 | Tiny change: 'cases. If adding `s' -> 'cases. If extending our candidate window by adding `s' | |
| en6 |
|
dajeff | 2025-03-12 10:37:05 | 1069 | ||
| en5 |
|
dajeff | 2025-03-12 09:52:37 | 553 | Tiny change: 'bbf58f/)\n```cpp\n' -> 'bbf58f/)\n\n```cpp\n' | |
| en4 |
|
dajeff | 2025-03-12 09:46:17 | 0 | ||
| en3 |
|
dajeff | 2025-03-12 09:46:17 | 1508 | ||
| en2 |
|
dajeff | 2025-03-12 09:44:10 | 2372 | ||
| en1 |
|
dajeff | 2025-02-25 23:01:50 | 2480 | Initial revision (saved to drafts) |
