mirror of
https://github.moeyy.xyz/https://github.com/trekhleb/javascript-algorithms.git
synced 2025-01-01 06:09:42 +08:00
.. | ||
__test__ | ||
longestCommonSubstring.js | ||
README.md |
Longest Common Substring Problem
The longest common substring problem is to find the longest string (or strings) that is a substring (or are substrings) of two or more strings.
Example
The longest common substring of the strings ABABC
, BABCA
and
ABCBA
is string ABC
of length 3. Other common substrings are
A
, AB
, B
, BA
, BC
and C
.
ABABC
|||
BABCA
|||
ABCBA