Implement Fibonacci Sequence | Dataford Interview Questions

K-State applications may need short numeric sequences for demonstrations or test data. Given a nonnegative integer n, generate the first n values of the Fibonacci sequence, beginning with 0, 1.

The Fibonacci sequence is defined as F(0) = 0, F(1) = 1, and F(i) = F(i - 1) + F(i - 2) for i >= 2.

Formal Specification

Implement fibonacci_sequence(n).

Input: An integer n, where 0 <= n <= 30.
Output: A list containing exactly the first n Fibonacci numbers, from F(0) through F(n - 1).
Return an empty list when n is 0.

Constraints

0 <= n <= 30
The output contains exactly n integers
The sequence starts with 0, 1
Use integer arithmetic

Function Signature

def fibonacci_sequence(n):

Your question is Implement Fibonacci Sequence. 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