Problem 2523. longest common substring : Skipped character version

Created by rifat
Appears in 2 groups

Difficulty:Rate

Solve Later
Add To GroupÃ‚

Two strings are given. Find the longest common substring between them. The substring characters need not be adjacent. They, however, must appear in same order in both input strings.

Example:

str1 = 'abcdefghi';
str2 = 'zazbzczd';

output = 'abcd'

Solve

Solution Stats

93 Solutions
31 Solvers

Last Solution submitted on Mar 18, 2025

Last 200 Solutions

Problem Comments

4 Comments

4 Comments

Show 1 older comment

rifat on 20 Aug 2014

right.. corrected. Thanks :)

Alfonso Nieto-Castanon on 29 Sep 2014

perhaps add another test to avoid non-general solutions? (e.g. str1='abaa' str2='aaab' should return 'aaa')

James on 1 Nov 2017

For test 5:

str1 = 'a string with many characters';
str2 = 'zzz zzz zzz zzz zzz';

Why wouldn't the correct answer be four spaces instead of just one?

Solution Comments

Show comments

ANNOUNCEMENT

Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025

Hello Community, We're excited to announce that registration is now open for the...

Problem Recent Solvers31

Problem Tags

Community Treasure Hunt

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

Start Hunting!

Problem 2523. longest common substring : Skipped character version

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025

Problem Recent Solvers31

Suggested Problems

More from this Author44

Problem Tags

Community Treasure Hunt

Problem 2523. longest common substring : Skipped character version

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025

Problem Recent Solvers31

Suggested Problems

More from this Author44

Problem Tags

Community Treasure Hunt

Players