Cody

Problem 95. Given two strings, find the maximum overlap

Solution 2723580

Submitted on 21 Jul 2020
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Test Suite

Test Status Code Input and Output
1   Pass
s1 = [1 2 3 4 5]; s2 = [5 4 3 2]; s3_correct = [1 2 3 4 5 4 3 2]; assert(isequal(overlap(s1,s2),s3_correct))

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

2   Pass
s1 = [1 0 1 7 7 7 6]; s2 = [1 0 1 0 1]; s3_correct = [1 0 1 0 1 7 7 7 6]; assert(isequal(overlap(s1,s2),s3_correct))

s3 = [] i = 4 i = 3 s3 = 1 0 1 0 1 7 7 7 6 i = 2

3   Pass
s1 = [3 1 4 1 5 9 2 6 5 3 5]; s2 = [9 2 6 5]; s3_correct = [3 1 4 1 5 9 2 6 5 3 5]; assert(isequal(overlap(s1,s2),s3_correct))

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

4   Fail
s1 = 1:100; s2 = [50 51]; s3_correct = s1; assert(isequal(overlap(s1,s2),s3_correct))

s3 = [] i = 1 s3 = 0 i = 0

Assertion failed.

5   Pass
s1 = 90:10:200; s2 = 10:10:120; s3_correct = 10:10:200; assert(isequal(overlap(s1,s2),s3_correct))

s3 = [] i = 11 i = 10 i = 9 i = 8 i = 7 i = 6 i = 5 i = 4 s3 = 10 20 30 40 50 60 70 80 90 100 110 120 130 140 150 160 170 180 190 200 i = 3