Longest Common Substring
Print the length of the longest CONTIGUOUS string appearing in both A and B.
Input: two lines: string A, then string B.
Output: the longest common substring length (0 if none).
Constraints:
- 1 ≤ |A|, |B| ≤ 500
- lowercase letters
Sample Tests
Input 1
abcdxyz xyzabcd
Output 1
4
Input 2
abc def
Output 2
0
Discussion (opens after you solve — no spoilers before)
No comments yet.