ohh sorry my mistake LCS stands for Longest Common Subsequence On Wed, Jun 22, 2011 at 11:21 PM, SVIX <saivivekh.swaminat...@gmail.com>wrote:
> ah... i misunderstood the question... sorry.. > > On Jun 22, 12:01 pm, ankit mehta <mehta.bond...@gmail.com> wrote: > > You dont have to create longest palindrome, you have to find the > > longest palindrome. > > > > On Jun 22, 7:19 pm, SVIX <saivivekh.swaminat...@gmail.com> wrote: > > > > > > > > > > > > > > > > > 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 <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. > > -- Sunny Aggrawal B-Tech IV year,CSI Indian Institute Of Technology,Roorkee -- 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.
