Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
x = [1:10];
y = x;
z = true;
assert(isequal(are_equal(x,y),z));
|
2 | Pass |
x = [1:10 NaN];
y = x;
z = true;
assert(isequal(are_equal(x,y),z));
|
3 | Pass |
x = [2 4 6 NaN 8];
y = [2 4 NaN 6 8];
z = false;
assert(isequal(are_equal(x,y),z));
|
Find the longest sequence of 1's in a binary sequence.
2438 Solvers
533 Solvers
Generate N equally spaced intervals between -L and L
436 Solvers
Find nearest prime number less than input number
179 Solvers
369 Solvers