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 |
n = 1;
y_correct = 1;
assert(isequal(surround(n),y_correct))
|
2 | Pass |
n=3
y_correct = [1 2 1
2 3 2
1 2 1];
assert(isequal(surround(n),y_correct))
n =
3
|
3 | Pass |
n=5
y_correct = [1 2 3 2 1
2 3 4 3 2
3 4 5 4 3
2 3 4 3 2
1 2 3 2 1];
assert(isequal(surround(n),y_correct))
n =
5
|
4 | Pass |
n=7
y_correct = [1 2 3 4 3 2 1
2 3 4 5 4 3 2
3 4 5 6 5 4 3
4 5 6 7 6 5 4
3 4 5 6 5 4 3
2 3 4 5 4 3 2
1 2 3 4 3 2 1];
assert(isequal(surround(n),y_correct))
n =
7
|
5 | Pass |
n=11
y_correct = [ 1 2 3 4 5 6 5 4 3 2 1
2 3 4 5 6 7 6 5 4 3 2
3 4 5 6 7 8 7 6 5 4 3
4 5 6 7 8 9 8 7 6 5 4
5 6 7 8 9 10 9 8 7 6 5
6 7 8 9 10 11 10 9 8 7 6
5 6 7 8 9 10 9 8 7 6 5
4 5 6 7 8 9 8 7 6 5 4
3 4 5 6 7 8 7 6 5 4 3
2 3 4 5 6 7 6 5 4 3 2
1 2 3 4 5 6 5 4 3 2 1];
assert(isequal(surround(n),y_correct))
n =
11
|
Find the longest sequence of 1's in a binary sequence.
3370 Solvers
856 Solvers
Test if two numbers have the same digits
187 Solvers
238 Solvers
708 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!