The Longest Common Substring is an approach in which we find out the the Longest Common Substring from the two input strings
Eg:-
s1="abbaf"
s2="abcdef"

The result will be 2 as the length of the Longest Common Substring which is "ab" is 2