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
Show
1 older comment
rifat
on 20 Aug 2014
right.. corrected. Thanks :)
Alfonso Nieto-Castanon
on 29 Sep 2014
perhaps add another test to avoid non-general solutions? (e.g. str1='abaa' str2='aaab' should return 'aaa')
James
on 1 Nov 2017
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
-
1624 Solvers
-
Sum of diagonal of a square matrix
1589 Solvers
-
463 Solvers
-
Right Triangle Side Lengths (Inspired by Project Euler Problem 39)
1873 Solvers
-
4649 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!