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 Solvers54
Suggested Problems
-
Construct an index vector from two input vectors in vectorized fashion
460 Solvers
-
Square Digits Number Chain Terminal Value (Inspired by Project Euler Problem 92)
265 Solvers
-
Reverse the elements of an array
1129 Solvers
-
445 Solvers
-
Write a function man that takes a row vector v and returns a matrix H as follows..
651 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!
