Given two strings, find the longest string which is contained within both strings.
e.g. the longest string that is contained in the words 'banana' and 'anagram' is 'ana'
If there is no match, return an empty string.
Solution Stats
Problem Comments
3 Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers64
Suggested Problems
-
5114 Solvers
-
Calculate the Levenshtein distance between two strings
1511 Solvers
-
295 Solvers
-
422 Solvers
-
95 Solvers
More from this Author5
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
arrrgh i dont have a matlab right now, im at home. trying on this test suit is boring..
Additional test cases have been added.
What if the solution is non-unique?