Sequences + Longest Common Subsequence
Longest Common Substring
n strings are given. Find their common substring of maximum length. It is known that its length is positive.
First line contains the number of strings n (1 ≤ n ≤
105). Each of the next n strings contains one line of lowercase Latin letters. The total sum of strings' length is no more than
Print the common substring of maximum length.
2 abaabbbba aabaaba