Cody

Problem 95. Given two strings, find the maximum overlap

Given two strings s1 and s2, create a new string s3 which is as short as possible and contains both strings.

If

 s1 = [1 2 3 4 5]

and

 s2 = [5 4 3 2]

then

 s3 = [1 2 3 4 5 4 3 2]

There is guaranteed to be one best solution.

Solution Stats

30.88% Correct | 69.12% Incorrect
Last solution submitted on Oct 09, 2019

Problem Comments

Solution Comments

Problem Recent Solvers294

Suggested Problems

More from this Author95

Problem Tags