Fibonacci Sequence

Easy

The fibonacci sequence of a number n is the sum of the 2 previous numbers in the sequence.

The first 10 numbers of the sequence are:

0, 1, 1, 2, 3, 5, 8, 13, 21, 34

Mathematically speaking, the fibonacci sequence is:

F(n) = F(n - 1) + F(n - 2)

Note that the first two numbers in a fibonacci sequence are:

F(1) = 0
F(2) = 1

Write a function that returns the fibonacci sequence of a number n.

Try it first

def fib(n: int):
    # implement fib here
    return 0

1def fib(n: int):
2    # implement fib here
3    return 0
4

Master Recursion & Dynamic Programming by trying the coding challenges below.

Stack Bash helps new and veteran software engineers master data structures and algorithms for technical interviews.