Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
A = [-5 17; 10 0];
B = [-15 3; 100 0];
y_correct = [ 5 1;
10 0];
assert(isequal(divi(A,B),y_correct))
|
2 | Pass |
A = [24 39; 6 89];
B = [-18 169; 250 17];
y_correct = [ 6 13;
2 1];
assert(isequal(divi(A,B),y_correct))
|
Find the longest sequence of 1's in a binary sequence.
2439 Solvers
960 Solvers
337 Solvers
Find out missing number from a vector of 9 elements
207 Solvers
229 Solvers