Longest Common Substring
Problem
Given two strings, find the longest common substring.
Return the length of it.
Example
Given A = "ABCD"
, B = "CBCE"
, return 2
.
Note
The characters in substring should occur continuously in original string. This is different with subsequence.
Challenge
O(nm)
time and memory.