Given two strings \(s\) and \(t\) consisting of only lowercase English alphabets, find the length of Longest Common Substring of the two strings.
Input:
The first line contains a string \(s\) of length \(n\).
The second line contains a string \(t\) of length \(m\).
Output:
Output a single line denoting the length of Longest Common Substring of the two strings.
Constraints:
\(1 \le n, m \le 10^5 \)
It is guaranteed that the strings \(s\) and \(t\) only contains lowercase English alphabets.
abcba acab
2
The longest common substring is "ab". Other common substrings are "a", "c" and "b".
Please login to use the editor
You need to be logged in to access the code editor
Loading...
Please wait while we load the editor
Login to unlock the editorial
Please login to use the editor
You need to be logged in to access the code editor
Loading...
Please wait while we load the editor