Problem 2512. longest common semi-substring

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

37.96% Correct | 62.04% Incorrect
Last Solution submitted on Jul 15, 2025

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers34

Suggested Problems

More from this Author44

Problem Tags

string algorithm

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!