Описание тега longest-substring
Longest Substring is a classic computer science problem: given two strings, find the common strings, then return the string(s) in common with the greatest length.
The longest common substring problem is a derivative of the edit distance problem, which focuses on the most common typing errors:
- namely character omissions
- insertions
- substitutions
- reversals
The idea is to compute the minimum number of operations that it would take to transform one string into another. The longest common substring problem follows with the following constraints:
- substitutions are forbidden
- only exact character match, insert, and delete are allowable edit operations
References