I don't think a O(n) solution exists... for each candidate string we find, we'll still have to validate that its a palindrome right?
On Jul 1, 5:10 am, bittu <[email protected]> wrote: > sorry for typo that is O(N^2) > > Thanks > Shashank -- 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.
