Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
x = [1];
y_correct = 1;
assert(isequalwithequalnans(your_fcn_name(x),y_correct))
|
2 | Pass |
x = [1 NaN 3 4 5 56];
y_correct = NaN;
assert(isequalwithequalnans(your_fcn_name(x),y_correct))
|
Find the longest sequence of 1's in a binary sequence.
3370 Solvers
2500 Solvers
Given a window, how many subsets of a vector sum positive
743 Solvers
324 Solvers
262 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!