Finding all the common substrings of given two strings

Question

I have come across a problem statement to find the all the common sub-strings between the given two sub-strings such a way that in every case you have to print the l

Answer 1

Typically this type of substring matching is done with the assistance of a separate data structure called a Trie (pronounced try). The specific variant that best suits this problem is a suffix tree. Your first step should be to take your inputs and build a suffix tree. Then you'll need to use the suffix tree to determine the longest common substring, which is a good exercise.