http://www.akalin.cx/longest-palindrome-linear-time
lovely explanation.. Best Regards Ashish Goel "Think positive and find fuel in failure" +919985813081 +919966006652 On Tue, Jan 24, 2012 at 7:52 PM, Ashish Goel <ashg...@gmail.com> wrote: > while suffix tree of str and reverse(str) and finding deepst fork to get > the palindrome works, there is a solution available at > http://johanjeuring.blogspot.com/2007/08/finding-palindromes.html > which is O(n). Can anyone explain this, a bit complex for me. > > Best Regards > Ashish Goel > "Think positive and find fuel in failure" > +919985813081 > +919966006652 > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
