Fibonacci Series Implementation | Dataford Interview Questions

Tell me about how you would implement the Fibonacci series and verify it with a few test cases.

Implement def fibonacci(n):, returning a list containing the first n Fibonacci numbers, starting with 0, 1. For n = 0, return an empty list; for example, n = 5 returns [0, 1, 1, 2, 3], and n = 1 returns [0]. Assume 0 <= n <= 1000.

Constraints

0 <= n <= 1000
Return exactly n values
The sequence starts with 0 and 1

Function Signature

def fibonacci(n):

Your question is Fibonacci Series Implementation. 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

Tell me about how you would implement the Fibonacci series and verify it with a few test cases.

Constraints

0 <= n <= 1000
Return exactly n values
The sequence starts with 0 and 1

Function Signature

def fibonacci(n):

Your question is Fibonacci Series Implementation. 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.