Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
a = [ ...
1 2 0 0 0
0 0 5 0 0
2 7 0 0 0
0 6 9 3 3];
r_correct = 4;
assert(isequal(fullest_row(a),r_correct))
rCounter =
2 1 2 4
M =
4
r =
4
|
2 | Pass |
a = [ ...
1 2 0 0
0 0 5 0
0 6 9 -3
2 7 0 0
0 0 0 0];
r_correct = 3;
assert(isequal(fullest_row(a),r_correct))
rCounter =
2 1 3 2 0
M =
3
r =
3
|
3 | Pass |
a = [ ...
1 0 0
0 0 0
0 0 0
0 0 0
0 2 3];
r_correct = 5;
assert(isequal(fullest_row(a),r_correct))
rCounter =
1 0 0 0 2
M =
2
r =
5
|
4 | Pass |
a = [ ...
0
0
0
-3
0
0];
r_correct = 4;
assert(isequal(fullest_row(a),r_correct))
M =
logical
1
r =
4
|
Sort a list of complex numbers based on far they are from the origin.
3791 Solvers
Given an unsigned integer x, find the largest y by rearranging the bits in x
524 Solvers
205 Solvers
242 Solvers
296 Solvers