Compute Nth Fibonacci Number

EasyPython00:00

Flowcode

Your interviewer · Software Engineer

In session

Interviewer

Welcome to the Python screen for the Software Engineer role at Flowcode.

The question is on your right: Compute Nth Fibonacci Number. Read through the requirements first.

Would you like to talk through your approach, or are you ready to start coding?

Talking through your plan before coding is graded well.

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

Run as often as you like, then submit when the output looks right.

Run your code to see test output