Jump to content

Longest repeated substring problem

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by MarshBot (talk | contribs) at 23:38, 5 November 2006 (Adding {{linkless}} template to orphan article). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Template:Linkless The problem of finding the longest substring of a string that occurs multiple times.