This solution is outdated. To rescore this solution, sign in.
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
x = [];
y_correct = [];
assert(isequal(common_by_row(x),y_correct))
y =
[]
|
2 | Pass |
x = [1e100; 1e100];
y_correct = [1e100];
assert(isequal(common_by_row(x),y_correct))
y =
1.0000e+100
|
3 | Pass |
x = [1; 2];
y_correct = [];
assert(isequal(common_by_row(x),y_correct))
y =
[]
|
4 | Pass |
x = ones(10);
y_correct = [1];
assert(isequal(common_by_row(x),y_correct))
y =
1
|
5 | Pass |
x = magic(10);
y_correct = [];
assert(isequal(common_by_row(x),y_correct))
y =
[]
|
6 | Pass |
x = wilkinson(9);
y_correct = [0 1];
assert(isequal(common_by_row(x),y_correct))
y =
0 1
|
7 | Pass |
x = [3 -2 1 NaN; NaN 0 -2 3];
y_correct = [-2 3];
assert(isequal(common_by_row(x),y_correct))
y =
-2 3
|
The Goldbach Conjecture, Part 2
1284 Solvers
337 Solvers
Find the maximum number of decimal places in a set of numbers
734 Solvers
724 Solvers
364 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!