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.
Solve

Solution Stats

171 Solutions

57 Solvers

Last Solution submitted on Aug 13, 2026

Last 200 Solutions

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers57

Chris Cleveland Zion Keshav Herman

Suggested Problems

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!