= Longest repeated substring problem
{wiki=Longest_repeated_substring_problem}
The Longest Repeated Substring Problem is a classic problem in computer science and string processing, which involves finding the longest substring within a given string that appears more than once. In other words, we're looking for the longest segment of characters that can be found in the string multiple times, without overlapping. \#\#\# Problem Definition Given a string \`S\` of length \`n\`, the goal is to find the longest substring \`L\` such that \`L\` occurs at least twice in \`S\`.
Back to article page
