@sumit : whats your nlogn approach ??? On Wed, Dec 28, 2011 at 11:27 AM, sumit mahamuni <[email protected] > wrote:
> Here I can think of O( n * log n ). can anyone think of better solution?? > > On Tue, Dec 27, 2011 at 11:06 PM, atul007 <[email protected]> wrote: > >> Given a string of length N, find whether there exits an even length >> palindrome substring. >> what would be efficient way of solving this problem.? >> >> -- >> 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. >> >> > > > -- > Thanks and Regards, > Sumit Mahamuni. > > -- Slow code that scales better can be faster than fast code that doesn't > scale! > -- Tough times never lasts, but tough people do. > -- I love deadlines. I like the whooshing sound they make as they fly by. > - D. Adams > > -- > 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. > -- 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.
