Find Longest Common Substring
Anonymous
main() { char a[] = {'f', 'a', 't', 'h', 'e', 'r'}; char b[] = {'m', 'o', 't', 'h', 'e', 'r'}; int maxPos = 0; int maxLen = 0; int posA = 0; int max = 0; for(int i = 0; i maxLen) { maxLen = max; maxPos = i; } } else { max = 0; posA = i; } } } //print maxPos;" //print maxLen; }
Check out your Company Bowl for anonymous work chats.