Top all-time · #15599
Fred Akalin
Personal blog · akalin.cxmathprogramming
Fred Akalin's personal blog at akalin.cx covers math and programming. Since 2011, 5 different Hacker News readers have linked it 7 times. The last post was in 2021, but the archive is still widely read.
Too few sampled comments (3) to say how often HN recommends it.?
Why HN links it
Readers link Fred Akalin's palindrome posts on finding the longest palindromic substring. One commenter calls a linked post a good explanation of a linear-time method that avoids suffix trees.
Summarised by Claude from a sample of 3 HN comments that link here. Each comment is marked recommending, critical or neutral (citing without judging); how this works.
Most-linked posts?
- /longest-palindrome-linear-time2 people · 2 mentions · first linked 2012-04-09
What Hacker News says?
My guess is because suffix trees are covered in data-structures courses, and then finding palindromes comes up as a possible application. Whereas Manacher's algorithm is pretty specifically a palindrome-finding algorithm, so people only know about it if they're looking for palindrome-finding algorithms in particular (as opposed to example applications of data structures). Although, it and variants have gotten some w…
Comment linking /longest-palindrome-linear-time
on “O(n) algorithm to find longest palindromic substring w/o suffix trees”Submitted Computing the Integer Square Root as a story · 3 points
HN discussionThanks for the feedback! In my defense, I can only say that I was a less-experienced coder when I wrote that. :) 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…
Comment linking /primality-testing-polynomial-time-part-2
on “How do I find the longest palindrome in a string?”Submitted An introduction to primality testing as a story · 2 points
HN discussionFor 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
Comment linking /longest-palindrome-linear-time
on “How do I find the longest palindrome in a string?”Submitted Finding the longest palindromic substring in linear time as a story · 1 points
HN discussion