Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
n = 10;
flagSame = isequal(makeRandomOrdering(n), makeRandomOrdering(n));
flagAllUsed = isequal([1:n],sort(makeRandomOrdering(n)));
assert(~flagSame & flagAllUsed)
|
Return the largest number that is adjacent to a zero
3118 Solvers
1611 Solvers
Find the peak 3n+1 sequence value
792 Solvers
Program an exclusive OR operation with logical operators
597 Solvers
Project Euler: Problem 2, Sum of even Fibonacci
463 Solvers