heres the code: http://ideone.com/aiG1m using the algo from http://www.akalin.cx/2007/11/28/finding-the-longest-palindromic-substring-in-linear-time/
On Jun 21, 11:31 pm, Swathi <chukka.swa...@gmail.com> wrote: > Does any one know how to return the "Longest palindrome in a string in > O(n)". > From googling i found that we can use suffix trees but there is no code. I > am looking for logic and also for running code. > > Thanks, > Swathi -- 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.
