Revision history [back]

The process for determining the longest common substring involves the following steps:

1. First, identify the two strings that need to be compared.

2. Iterate through all possible substrings of the first string, starting with the longest substring and moving to shorter substrings.

3. For each substring of the first string, iterate through all possible substrings of the second string, starting with the longest substring and moving to shorter substrings.

4. If a matching substring is found in both strings, record the length of the substring and continue iterating through the second string.

5. When all possible substrings have been checked for the current substring of the first string, move on to the next shorter substring.

6. Repeat steps 3-5 until a matching substring is found or all substrings have been checked.

7. The longest common substring is the substring of the first string with the maximum length that also appears in the second string.