Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
bbi5291
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
8 ms
·
1.
▲
by
bbi5291
15y ago
Quoting the article: "Every palindromic substring has a centre. For an odd-length substring, this is its middle character; for an even-length substring, this is the imaginary space between its two middle characters. Call each character and
2.
▲
by
bbi5291
15y ago
I think the answer to this is that the suffix tree algorithm is conceptually simpler if you already know suffix trees . Personally, I find Manacher's algorithm very difficult to intuit (and I'm the one who wrote the article in this post