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 | Fail |
%%
a = [1, 5, 3, 0, 2, 7, 0, 8, 9, 1 0];
b = 8;
assert(isequal(nearZero(a),b))
Error: You may not use the command(s) evalin in your code
|
2 | Fail |
%%
a = [5 4 -1 0 -2 0 -5 8];
b = -1;
assert(isequal(nearZero(a),b));
Error: You may not use the command(s) evalin in your code
|
3 | Fail |
%%
a = [0 3 1 0 2 9];
b = 3;
assert(isequal(nearZero(a),b));
Error: You may not use the command(s) evalin in your code
|
4 | Fail |
%%
a = [1 0 2 0 3];
b = 3;
assert(isequal(nearZero(a),b));
Error: You may not use the command(s) evalin in your code
|
5 | Fail |
%%
a = [0 -1];
b = -1;
assert(isequal(nearZero(a),b));
Error: You may not use the command(s) evalin in your code
|
6 | Fail |
%%
a = [0 -12 0 -7 0];
b = -7;
assert(isequal(nearZero(a),b));
Error: You may not use the command(s) evalin in your code
|
Find the alphabetic word product
1997 Solvers
616 Solvers
Number of 1s in the Binary Representation of a Number
319 Solvers
190 Solvers
348 Solvers