Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
For example, given string “abc fghi bc kl abcd lkm abcdefg“, the function should return string “abcd” and the count of 2.
A O(n^2) solution seems easy but I am looking for a better solution.
Edited: If nothing better than O(n^2) is possible than which approach would be best performance wise.
You can solve this in linear time by building a suffix tree and taking a path from the root to the deepest internal node; this will give you the longest repeated string. Once you have that string, it’s trivial to count the number of times it appears.