How to find the longest palindrome in a given string?

Posted by Hun1Ahpu on Stack Overflow See other posts from Stack Overflow or by Hun1Ahpu
Published on 2010-04-20T16:49:51Z Indexed on 2010/04/20 16:53 UTC
Read the original article Hit count: 272

I know how to do this in O(n^2). But it seems like there exist a better solution.

I've found this, and there is a link to O(n) answer, but it's written in Haskell and not clear for me.

It would be great to get an answer in c# or similar.

© Stack Overflow or respective owner

Related posts about algorithm

Related posts about interview-questions