Cody

Problem 2523. longest common substring : Skipped character version

Created by rifat in Community

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

43.86% Correct | 56.14% Incorrect
Last solution submitted on Apr 21, 2019

Problem Comments

Solution Comments