Problem 95. Given two arrays, find the maximum overlap
Given two (integer) arrays s1 and s2, create a new array s3 which is as short as possible and contains both arrays.
#1
s1 = [1 2 3 4 5]
s2 = [5 4 3 2]
s3 = [1 2 3 4 5 4 3 2]
There is guaranteed to be one best solution.
8/8/22 - New test case added (and solutions have been rescored)
#2
%courtesy of comments
s1 = [-1 -2 -3]
s2 = [-3 -1 -2]
s3 = [-3 -1 -2 -3]
Solution Stats
Problem Comments
-
12 Comments
Show
9 older comments
Shlomo Geva
on 17 Nov 2020
minor point - the specification is poorly worded.
The test input/output is not strings, but rather integer arrays.
e.g.
s1 = [10 20 30 40 50]
rather than "10 20 30 40 50"
I suppose this problem was written before the introduction of strings to Matlab (2016b) and so it may not have been so ambiguous at the time. (although even back then I would have interpreted the word "string" to mean a character array.)
Vishrut
on 11 Jul 2022
Good Question
邵俊淞2353280
on 1 Aug 2024
difficult
Solution Comments
Show commentsProblem Recent Solvers1550
Suggested Problems
-
Find common elements in matrix rows
2661 Solvers
-
How to find the position of an element in a vector without using the find function
2742 Solvers
-
715 Solvers
-
633 Solvers
-
555 Solvers
More from this Author96
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!