Fibonacci Number Program | Dataford Interview Questions

Write a program to generate Fibonacci numbers.

Implement generate_fibonacci(n) to return the first n Fibonacci numbers, starting with 0 and 1. The sequence is defined as F(0) = 0, F(1) = 1, and F(k) = F(k - 1) + F(k - 2) for k >= 2.

The function must return an empty list when n is 0.

Input: A non-negative integer n.

Output: A list containing exactly n Fibonacci numbers.

Examples:

n = 5 returns [0, 1, 1, 2, 3].
n = 1 returns [0].

Constraints: 0 <= n <= 100.

Constraints

0 <= n <= 100
Return exactly n values
The sequence starts with F(0) = 0 and F(1) = 1

Function Signature

def generate_fibonacci(n):

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