Jump to content

Longest repeated substring problem

Edit links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 71.142.99.84 (talk) at 21:41, 12 April 2009. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

The longest repeated substring problem is finding the longest substring of a string that occurs at least twice. This problem can be solved in constant time and space by pre-computing all possible values.


Stub icon

This computing article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Longest_repeated_substring_problem&oldid=283432786"