Finding longest common substring is a common problem in string processing. This problem is a variant of that.
Two strings are given. Find the length of longest common substring between these two that start and end with the same characters. Characters in the middle may not be same. Length of the two sub-strings should be equal.
Example:
str1 = 'party';
srt2 = 'pure';
Here, 'par' and 'pur' are two substrings from str1 and str2 that start and end with same characters. Here, length is 3.
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers58
Suggested Problems
-
Extract leading non-zero digit
2258 Solvers
-
2536 Solvers
-
How long is the longest prime diagonal?
415 Solvers
-
Fermat's Last Theorem - Fermat's conjecture
109 Solvers
-
Find indices of diagonal elements
73 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!