Recursive or Iterative Fibonacci | Dataford Interview Questions

Write a function that calculate fibonacci number. Write it using recursion/loop (whichever you did not use in the first question).

Implement def fibonacci(n): for a nonnegative integer n. Return the nth Fibonacci number using F(0) = 0 and F(1) = 1. Provide an implementation using the approach not used in the first question, and ensure it handles the stated bounds.

Constraints

0 <= n <= 30
Return an integer
Use zero-based Fibonacci indexing: F(0) = 0 and F(1) = 1

Function Signature

def fibonacci(n):

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

Write a function that calculate fibonacci number. Write it using recursion/loop (whichever you did not use in the first question).

Constraints

0 <= n <= 30
Return an integer
Use zero-based Fibonacci indexing: F(0) = 0 and F(1) = 1

Function Signature

def fibonacci(n):

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