couldn't we just collect all the letters that occur more than twice and play them back even number of times symmetrically? and if there are more letters left, we can put one of them in the center...
linear time.... need additional memory for some kind of hashing On Jun 21, 11:31 am, Swathi <[email protected]> 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 [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
