it's a classic problem like Time = O(n*n), space = O(n) On Tue, Mar 13, 2012 at 12:55 PM, InThirstOfWisdom.rr < [email protected]> wrote:
> Algorithm to find the longest common substring of given set of > strings, with much less time and space complexity. > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
