Longest Common Substring - using suffix trie

Longest Common Substring - using suffix trie Time Complexity: O(m^2 + n^2) this can be reduced to linear using Ukonnen's algorithm