Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
filetext = fileread('oddEven.m');
assert(isempty(strfind(filetext, 'regexp')),'regexp hacks are forbidden')
|
2 | Pass |
filetext = fileread('oddEven.m');
loopUsed = any(strfind(filetext, 'while')) || any(strfind(filetext, 'for'));
assert(~loopUsed, 'Loops are forbidden')
|
3 | Pass |
v = [];
w_correct = [];
assert(isequal(oddEven(v),w_correct))
ans =
[]
|
4 | Pass |
v = [2; 7; 0; 3; 2];
w_correct = [7; 3; 2; 0; 2];
assert(isequal(oddEven(v),w_correct))
ans =
7
3
2
0
2
|
5 | Pass |
v = [1, 0, 2, 9, 3, 8, 8, 4];
w_correct = [1, 9, 3, 0, 2, 8, 8, 4];
assert(isequal(oddEven(v),w_correct))
ans =
1 9 3 0 2 8 8 4
|
6 | Pass |
odd = 2 * randi([-4, 4], 1, randi([4,10])) - 1;
even = 2 * randi([-4, 4], 1, randi([4,10]));
v = [even, odd];
w_correct = [odd, even];
assert(isequal(oddEven(v),w_correct))
ans =
3 5 -3 5 7 3 -4 -2 8 -4 2 -4 2 4
|
Similar Triangles - find the height of the tree
156 Solvers
406 Solvers
Remove the two elements next to NaN value
309 Solvers
691 Solvers
206 Solvers