Problem 2523. longest common substring : Skipped character version

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'

Solution Stats

49.41% Correct | 50.59% Incorrect
Last Solution submitted on Jun 08, 2024

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers27

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!