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 |
x = 1;
y_correct = 1;
assert(isequal(rainbow(x),y_correct))
a =
1
ans =
1
|
2 | Pass |
x = 3;
y_correct = [1 2 3; 2 3 2; 3 2 1];
assert(isequal(rainbow(x),y_correct))
a =
1 2 3
ans =
1 2 3
2 3 2
3 2 1
|
3 | Pass |
x = 5;
y_correct = [1 2 3 4 5; 2 3 4 5 4; 3 4 5 4 3; 4 5 4 3 2; 5 4 3 2 1];
assert(isequal(rainbow(x),y_correct))
a =
1 2 3 4 5
ans =
1 2 3 4 5
2 3 4 5 4
3 4 5 4 3
4 5 4 3 2
5 4 3 2 1
|
4 | Pass |
x = 7;
y_correct = [...
1 2 3 4 5 6 7;
2 3 4 5 6 7 6;
3 4 5 6 7 6 5;
4 5 6 7 6 5 4;
5 6 7 6 5 4 3;
6 7 6 5 4 3 2;
7 6 5 4 3 2 1];
assert(isequal(rainbow(x),y_correct))
a =
1 2 3 4 5 6 7
ans =
1 2 3 4 5 6 7
2 3 4 5 6 7 6
3 4 5 6 7 6 5
4 5 6 7 6 5 4
5 6 7 6 5 4 3
6 7 6 5 4 3 2
7 6 5 4 3 2 1
|
Given an unsigned integer x, find the largest y by rearranging the bits in x
780 Solvers
2143 Solvers
444 Solvers
Find the index of n in magic(n)
160 Solvers
664 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!