Problem 2523. longest common substring : Skipped character version
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'
Solution Stats
Problem Comments
-
4 Comments
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?
Solution Comments
Show commentsProblem Recent Solvers27
Suggested Problems
-
180 Solvers
-
Find out the Gray Code for a Given Binary Number
103 Solvers
-
Convert to Binary Coded Decimal
130 Solvers
-
Mersenne Primes vs. All Primes
587 Solvers
-
9092 Solvers
More from this Author44
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!