(Solved): Suppose that we are given two strings, s1 and s2. Instead of finding the longest common subsequence, ...

Suppose that we are given two strings, s1 and s2. Instead of finding the longest common subsequence, we want to find the longest common substring (of contiguous characters). How would we modify the longest common subsequence algorithm so that it finds common substrings instead of common subsequences, without changing the runtime class? This is for java. No code is needed, just an algorithm discussion.