Longest repeated substring problem
Appearance
Template:Linkless The problem of finding the longest substring of a string that occurs multiple times.
Template:Linkless The problem of finding the longest substring of a string that occurs multiple times.
![]() | This computing article is a stub. You can help Wikipedia by expanding it. |