Cody

Problem 12. Fibonacci sequence

Solution 1810601

Submitted on 8 May 2019 by Rashmi Doijode
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Solve This Problem View on Solution Map

Test Suite

Test Status Code Input and Output
1   Pass
n = 1; f = 1; assert(isequal(fib(n),f))

a = 0 1 1 1
2   Pass
n = 6; f = 8; assert(isequal(fib(n),f))

a = 5 8 8 13
3   Pass
n = 10; f = 55; assert(isequal(fib(n),f))

a = 34 55 55 89
4   Pass
n = 20; f = 6765; assert(isequal(fib(n),f))

a = 4181 6765 6765 10946

Suggested Problems

More from this Author95