How do I find the longest palindrome in a string?

http://codegolf.stackexchange.com/questions/16327/how-do-i-find-the-longest-palindrome-in-a-string

by JoeCortopassi • 13 years ago

31 11 13 years ago

codegolf.stackexchange.com

nilkn• 13 years ago

For anyone interested in how to actually do this efficiently, without building a suffix tree, here's a good explanation: http://www.akalin.cx/longest-palindrome-linear-time

thirsteh• 13 years ago

Cool, but unfortunately also a great example of when excessive commenting actually makes the code less digestible.

zhaodaxiong• 13 years ago

Right. A figure could be more intuitive. But the algorithm is tricky itself anyway...

sleazebreeze2• 13 years ago

In addition, the use of cryptic variable names like s, e, d or j with big block comments describing what each one stands for is particularly irritating.

mmahemoff• 13 years ago

"generate a set of every single possible Palindrome as large as the string you're testing"

This kind of memoization could well be the most efficient solution in the real world, albeit not one that will pass your CS 101 exam.

More generally #codetrolling is like putting the creative hat on and will probably help people to come up with out-of-the-box tricks that could in some cases be quite useful.

WalterBright• 13 years ago

Just search for "notlob".

mmayberry• 13 years ago

Wasnt this the old Cue/Greplin hiring challenge from years back?

slfisher• 13 years ago

Finally, a job for LISP.

knightnii• 13 years ago

suffix tree. same as longest subsequence problem. create suffix tree, reverse string and find longest subsequence.

How do I find the longest palindrome in a string?

Related Stories