Compute Nth Fibonacci Number | Dataford Interview Questions

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):

Your question is Compute Nth Fibonacci Number. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem