Write a Fibonacci Program | Dataford Interview Questions

VitalEdge's analytics tools need a small utility that generates Fibonacci values for sequence-based calculations. Given a non-negative integer n, return the first n terms of the Fibonacci sequence, starting with 0, 1.

Each term after the first two is the sum of the previous two terms. Return an empty list when n is 0.

Formal Specification

Implement fibonacci_series(n).

Input: An integer n representing the number of terms to generate.
Output: A list containing exactly n Fibonacci numbers.

Constraints

0 <= n <= 100
Return exactly n Fibonacci values
The sequence starts with 0, 1 when n >= 2
Use iteration rather than un-memoized recursion

Function Signature

def fibonacci_series(n):

Your question is Write a Fibonacci Program. 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