Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
x = [1 2; 3 4];
y_correct = 4;
assert(isequal(your_fcn_name(x),y_correct))
|
2 | Pass |
x = [3 7; 4 1];
y_correct = 7;
assert(isequal(your_fcn_name(x),y_correct))
|
Find the longest sequence of 1's in a binary sequence.
2444 Solvers
Who has power to do everything in this world?
256 Solvers
136 Solvers
Finding perimeter of a rectangle
194 Solvers
100 Solvers