Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
%%
x = [];
y_correct = [];
assert(isequal(common_by_row(x),y_correct))
|
2 | Pass |
%%
x = [1e100; 1e100];
y_correct = [1e100];
assert(isequal(common_by_row(x),y_correct))
|
3 | Pass |
%%
x = [1; 2];
y_correct = [];
assert(isequal(common_by_row(x),y_correct))
|
4 | Pass |
%%
x = ones(10);
y_correct = [1];
assert(isequal(common_by_row(x),y_correct))
|
5 | Pass |
%%
x = magic(10);
y_correct = [];
assert(isequal(common_by_row(x),y_correct))
|
6 | Pass |
%%
x = wilkinson(9);
y_correct = [0 1];
assert(isequal(common_by_row(x),y_correct))
|
7 | Pass |
%%
x = [3 -2 1 NaN; NaN 0 -2 3];
y_correct = [-2 3];
assert(isequal(common_by_row(x),y_correct))
|
Return the 3n+1 sequence for n
5202 Solvers
244 Solvers
Make a run-length companion vector
453 Solvers
Find nearest prime number less than input number
181 Solvers
Find out missing number from a vector of 9 elements
207 Solvers