Compute Nth Fibonacci Number

EasyPython

Problem

On a Glassdoor engineering screen, you may be asked to implement a basic sequence generator efficiently. Write a function that returns the nth Fibonacci number.

The Fibonacci sequence is defined as:

F(0) = 0
F(1) = 1
F(n) = F(n - 1) + F(n - 2) for n >= 2

Formal Specification

Input: An integer n
Output: An integer representing F(n)

Your solution should handle the base cases correctly and avoid the exponential slowdown of naive recursion.

Constraints

0 <= n <= 30
Input n is an integer
Return the exact nth Fibonacci number

Function Signature

def fibonacci(n):

CodePython 3

You need to log in / sign up to run or submit.Ln 2

Run your code to see test output here.