Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
%%
a = [1 2 3 4];
t = 0;
b_correct = [4 3 2 1];
assert(isequal(targetSort(a,t),b_correct))
|
2 | Pass |
%%
a = -4:10;
t = 3.6;
b_correct = [-4 -3 10 -2 9 -1 8 0 7 1 6 2 5 3 4];
assert(isequal(targetSort(a,t),b_correct))
|
3 | Pass |
%%
a = 12;
t = pi;
b_correct = 12;
assert(isequal(targetSort(a,t),b_correct))
|
4 | Pass |
%%
a = -100:-95;
t = 100;
b_correct = [-100 -99 -98 -97 -96 -95];
assert(isequal(targetSort(a,t),b_correct))
|
10762 Solvers
243 Solvers
Sum the numbers on the main diagonal
375 Solvers
325 Solvers
Is this is a Tic Tac Toe X Win?
369 Solvers