Problem 95. Given two strings, find the maximum overlap

Solution 1940379

Submitted on 17 Sep 2019 at 18:50 by Augusto Mazzei

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

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 = [] L = 3 L = 2 L = 1 s3 = 1 2 3 4 5 4 3 2
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 = [] L = 4 L = 3 s3 = 1 0 1 0 1 7 7 7 6
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	Pass	s1 = 1:100; s2 = [50 51]; s3_correct = s1; assert(isequal(overlap(s1,s2),s3_correct)) s3 = [] s3 = Columns 1 through 30 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 Columns 31 through 60 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 Columns 61 through 90 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 Columns 91 through 100 91 92 93 94 95 96 97 98 99 100
5	Pass	s1 = 90:10:200; s2 = 10:10:120; s3_correct = 10:10:200; assert(isequal(overlap(s1,s2),s3_correct)) s3 = [] L = 11 L = 10 L = 9 L = 8 L = 7 L = 6 L = 5 L = 4 s3 = 10 20 30 40 50 60 70 80 90 100 110 120 130 140 150 160 170 180 190 200