Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
x = [1 1 1
0 0 0
0 0 0];
y_correct = 1;
assert(isequal(your_fcn_name(x),y_correct))
|
2 | Pass |
x = [1 0 0
0 1 0
0 0 1];
y_correct = 1;
assert(isequal(your_fcn_name(x),y_correct))
|
3 | Pass |
x = [1 0 0
1 0 0
1 0 0];
y_correct = 1;
assert(isequal(your_fcn_name(x),y_correct))
|
4 | Pass |
x = [0 0 1
0 1 0
1 0 0];
y_correct = 1;
assert(isequal(your_fcn_name(x),y_correct))
|
5 | Pass |
x = [1 0 0
0 -1 0
0 0 1];
y_correct = 0;
assert(isequal(your_fcn_name(x),y_correct))
|
6 | Pass |
x = [1 0 0
0 1 0
0 0 1];
y_correct = 1;
assert(isequal(your_fcn_name(x),y_correct))
|
7 | Pass |
x = [-1 0 0
0 -1 0
0 0 -1];
y_correct = 0;
assert(isequal(your_fcn_name(x),y_correct))
|
Find all elements less than 0 or greater than 10 and replace them with NaN
11625 Solvers
2515 Solvers
406 Solvers
412 Solvers
Integer Sequence - II : New Fibonacci
139 Solvers