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.
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!
Back to basics 3 - Temp Directory
Spot the outlier
Implement simple rotation cypher
The sum of the numbers in the vector
Graph Algorithms 3: Number of Connected Components
Fermat's last theorem - again
Integer Sequence - 1
I want eval
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office