Fibonacci in Python | Dataford Interview Questions

DeltaV control applications may use generated numeric sequences for simulation and testing. Given a non-negative integer n, return the first n terms of the Fibonacci sequence, where the sequence begins with 0, 1 and each later term is the sum of the previous two terms.

Formal Specification

Implement fibonacci(n):

Input: an integer n, representing the number of Fibonacci terms to generate.
Output: a list containing exactly n integers in Fibonacci order.
For n = 0, return an empty list.
Use an iterative approach rather than recursive recomputation.

Constraints

0 <= n <= 10^4
The output contains exactly n integers
The sequence starts with 0, 1
Python integer arithmetic may be used for large Fibonacci values

Function Signature

def fibonacci(n):

Your question is Fibonacci in Python. 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