Recursive Fibonacci Implementation | Dataford Interview Questions

How would you write a recursive function to get the nth number in the Fibonacci sequence?

Use zero-based indexing: F(0) = 0 and F(1) = 1. Implement fib(n), which accepts a non-negative integer and returns the nth Fibonacci number. Explain the base cases and the time and space complexity of the direct recursive approach.

Constraints

0 <= n <= 30
Use zero-based indexing
Return an integer

Function Signature

def fib(n):

Your question is Recursive Fibonacci Implementation. 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

How would you write a recursive function to get the nth number in the Fibonacci sequence?

Constraints

0 <= n <= 30
Use zero-based indexing
Return an integer

Function Signature

def fib(n):

Your question is Recursive Fibonacci Implementation. 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.