Compute Nth Fibonacci Number

EasyPython00:00

Practice interviewer

In session

5 left

00:00

Your question is Compute Nth Fibonacci Number. Start with the requirements on the right.

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

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

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

Your solutionPython 3

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

Run your code to see test output