How do I find the longest palindrome in a string?
codegolf.stackexchange.com
How do I find the longest palindrome in a string?
1–10 of 12 posts
Re: How do I find the longest palindrome in a string?
#2Re: How do I find the longest palindrome in a string?
#3For 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
Re: How do I find the longest palindrome in a string?
#4For 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
Cool, but unfortunately also a great example of when excessive commenting actually makes the code less digestible.
Re: How do I find the longest palindrome in a string?
#5For 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
Cool, but unfortunately also a great example of when excessive commenting actually makes the code less digestible.
Re: How do I find the longest palindrome in a string?
#6This 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.
Re: How do I find the longest palindrome in a string?
#7Re: How do I find the longest palindrome in a string?
#8Re: How do I find the longest palindrome in a string?
#9Re: How do I find the longest palindrome in a string?
#10Earlier quoted context omitted.
Cool, but unfortunately also a great example of when excessive commenting actually makes the code less digestible.
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.
The comments were intended to extend the preceding prose explanation rather than being comments per se. The actual code is not much longer than the naive version, though, so if I get around to writing an updated version, I'd probably find some other method of conveying that info.
Some other things I'd do differently if I were to update it today:
- I'd write it in Javascript and provide a little interactive applet to play with it. (Similar to my posts on primality testing: http://www.akalin.cx/intro-primality-testing and http://www.akalin.cx/primality-testing-polynomial-time-part-... .)
- I'd upload the code to GitHub.
- I'd add unit tests.
Cheers!