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

4767 Solutions

1715 Solvers

Last Solution submitted on Jan 27, 2026

Last 200 Solutions

Problem Comments

Solution Comments

Show comments
Loading...

Group


Problem Recent Solvers1715

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!