5 ms·
Manacher's Algorithm – Longest Palindromic Substring
- wmkn 12y agoFinding palindromes in C strings. The most important problem in computer science. If software engineering job interviews are to be believed.
- amelius 12y agoAre there any applications for this?
- berodam 12y agoI've seen it used in an application that manages DNA plasmid data, it could be useful in a lot of genomic analysis tools.
- rawnlq 12y agoA slower O(nlog(n)) but IMO much simpler algorithm is to just using a rolling hash[1]. With linear time precomputation you can compute the hash of any substring range in constant time. Then for each position, you can just binary search for the longest palindrome centered at that position. [1]http://en.wikipedia.org/wiki/Rolling_hash http://en.wikipedia.org/wiki/Rolling_hash
- imslavko 12y agoIf you like this, Manacher's algo is very similar to z-string matching algo: http://codeforces.com/blog/entry/3107 http://codeforces.com/blog/entry/3107
- anon4 12y agoPeople, please. This presents a problem poignantly and provides a pleasant programmatic solution - the precise point of "hacker news". Be not so butt-bothered about non-apparent algorithm applications.
- JadeNB 12y agoBased on time-stamps, at the time you posted there were 4 comments, of which 2 complained about the lack of applications and 2 engaged seriously with the material. That seems too early in the discussion to be accusing the community (as opposed to 2 individual posters) of being "butt-bothered". On the other hand, there were no further such comments after your post, so maybe one could say that it worked. :-)
- jhdevos 12y agoWording is a bit sloppy: "Extending R (the inner while loop) takes at most a total of N steps, and positioning and testing each centers take a total of N steps too. Therefore, this algorithm guarantees to finish in at most 2*N steps, giving a linear time solution." What he means is that the total time taken by ALL executions of the inner loop combined is at most N, not that each run of the inner loop takes at most N steps (otherwise it would become quadratic).
- btilly 12y agoIf you don't get the explanation in the article, one of the multiple alternate explanations or corrections at http://stackoverflow.com/questions/10468208/manachers-algorithm-algorithm-to-find-longest-palindrome-substring-in-linear-t http://stackoverflow.com/questions/10468208/manachers-algori... might suffice instead.
- vishalzone2002 12y agoits funny its on HN. I just got asked this question in an tech interview last week..