Easy Neetcode Flashcards
1
Q
The Fibonacci numbers, commonly denoted F(n) form a sequence, called the Fibonacci sequence, such that each number is the sum of the two preceding ones, starting from 0 and 1. That is,
F(0) = 0, F(1) = 1
F(n) = F(n - 1) + F(n - 2), for n > 1.
Given n, calculate F(n)
A
def fib(n):
e0 = 0
e1 = 1
esum = 0
if n == 0:
return e0
elif n == 1:
return e1
else:
for i in range(2,n+1):
esum = e0 + e1
e0 = e1
e1 = esum
return esum
