Longest Common Substring Algorithm

The longest common substring of two or more strings is the longest string that appears as a contiguous substring of all of them, with applications including data deduplication and plagiarism detection; there may be more than one longest common substring for a given input. It differs from the longest common subsequence problem, which allows insertions or deletions within the shared text, because the longest common substring problem requires the shared text to be contiguous.