Hi Mac, Problem Have Discussed Several Time across various forums ,here one of the possible solution using Suffix Array in O(N^2)
http://shashank7s.blogspot.com/2011/06/longest-repeated-substring-eg-maximum.html Hope it will be helpful, let me know for if any test case its not working or any better approach (Except Suffix Tree:)) exist *Thanks Shashank Mani Computer Science Birla Institute of Technology Mesra* -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/8H6L_b8qrbMJ. 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.
