LCP Maximization

You are given two strings S and T each consisting of n characters. Each character in both the strings is one of the first ten Latin lowercase alphabet letters ('a'-'j'). The characters are numbered 1 through n in both strings. Let's denote S[l..r] as a substring of S which begins at the l'th character of S and ends at the r'th character of S. Longest common prefix (LCP) of two strings is the long