Common-substring

Longest Common Substring — DP and Rolling Hash Approaches

Find the longest common substring between two strings. DP approach O(nm), binary search + rolling hash O((n+m) log(n+m)).