Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
n = 1;
f = 1;
assert(isequal(fib(n),f))
|
2 | Pass |
n = 6;
f = 8;
assert(isequal(fib(n),f))
|
3 | Pass |
n = 10;
f = 55;
assert(isequal(fib(n),f))
|
4 | Pass |
n = 20;
f = 6765;
assert(isequal(fib(n),f))
|
Get the area codes from a list of phone numbers
417 Solvers
Project Euler: Problem 2, Sum of even Fibonacci
462 Solvers
Find perfect placement of non-rotating dominoes (easier)
228 Solvers
Create a square matrix of multiples
330 Solvers
Change the sign of even index entries of the reversed vector
214 Solvers