Iterative Fibonacci | Dataford Interview Questions

Please write a function to compute Fibonacci numbers in an iterative manner.

Implement fibonacci(n), where n is a non-negative integer and the sequence is defined as F(0) = 0 and F(1) = 1. Return the integer value of F(n) without using recursion.

Function Contract

Input: one integer n
Output: the nth Fibonacci number

Constraints

0 <= n <= 1000
Return the exact integer value of F(n)
Do not use recursion

Function Signature

def fibonacci(n):

Your question is 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