Fibonacci Coding | Dataford Interview Questions

Code an easy Fibonacci sequence.

Implement fibonacci(n) to return the first n Fibonacci numbers, starting with 0, 1. Return an empty list when n is zero.

Input: A non-negative integer n.

Output: A list containing exactly n Fibonacci numbers.

Examples:

def fibonacci(n):

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

Code an easy Fibonacci sequence.

Implement fibonacci(n) to return the first n Fibonacci numbers, starting with 0, 1. Return an empty list when n is zero.

Input: A non-negative integer n.

Output: A list containing exactly n Fibonacci numbers.

Examples:

def fibonacci(n):

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