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.
str1 = 'abcdefghi'; str2 = 'zazbzczd';
output = 'abcd'
Solution CommentsShow comments
Problem Recent Solvers25