Find the longest repeating string and the number of times it repeats in a given string

Question

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.

Longest repeated substring problem: en.wikipedia.org/wiki/Longest_repeated_substring_problem — sambowry
– sambowry, Commented Jan 31, 2010 at 14:44

jason · Accepted Answer · 2010-01-31 14:48:32Z

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.

Mahmoud Al-Qudsi · Accepted Answer · 2010-01-31 15:10:08Z

A state machine could probably give something better than big-O(N^2).

EDIT: The suffix tree suggested in the other answer is such an implementation of a state machine :)

Collectives™ on Stack Overflow

Find the longest repeating string and the number of times it repeats in a given string

2 Answers 2

Comments

Comments

Linked

Hot Network Questions

Collectives™ on Stack Overflow

2 Answers 2

Comments

Comments

Linked

Related