Two strings are given. Find the longest common substring between them. The substring characters need not be adjacent. They, however, must appear in same order in both input strings.
Example:
str1 = 'abcdefghi'; str2 = 'zazbzczd';
output = 'abcd'
Shouldn't there be two spaces between example and a in y_correct in test 4?
right.. corrected. Thanks :)
perhaps add another test to avoid non-general solutions? (e.g. str1='abaa' str2='aaab' should return 'aaa')
For test 5:
str1 = 'a string with many characters';
str2 = 'zzz zzz zzz zzz zzz';
Why wouldn't the correct answer be four spaces instead of just one?
Using regexp as outer function's delimiter...This is a hell of reverse thinking case! my hat is off, Bravo!
926 Solvers
13151 Solvers
57 Solvers
Make a run-length companion vector
429 Solvers
Find third Side of a right triangle given hypotenuse and a side. No * - or other functions allowed
90 Solvers