one solution could be :- hash every even number substring , starting from beginning. after this. hash every even number substring , starting from end. if it exists..means palindrome exists.
complexity would be O(N^2). 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. > > -- 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.
