Hi,
How to find the longest matching substring in 2 arrays..
Say we have 2 strings,
str1="abcdefghi" and str2="iabcdefgk" the answer must be "abcdefg"-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
