Problem 2523. longest common substring : Skipped character version

• Created by rifat
• Appears in 2 groups

×

By solving this problem, you will make progress in the following group(s)

Strings III

• 23 Problems
• 22 Finishers

Algorithm I

• 17 Problems
• 5 Finishers

Like (0)

Difficulty:

(11)

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

49.46% Correct | 50.54% Incorrect

• 93 Solutions
• 31 Solvers

Last Solution submitted on Mar 18, 2025

Last 200 Solutions

Solution Comments

Problem Recent Solvers31

Suggested Problems

• Sums with Excluded Digits

  2302 Solvers

• Encode Roman Numerals

  1980 Solvers

• Given a window, how many subsets of a vector sum positive

  859 Solvers

• Duplicate each element of a vector.

  619 Solvers

• Converting binary to decimals

  1585 Solvers

More from this Author44

• Let's see how peculiar we can get

  192 Solvers

• Generate Square Wave

  218 Solvers

• I want eval

  25 Solvers

• modular arithmetic

  71 Solvers

• BLOCK x3 (Version 2)

  5 Solvers