Print Fibonacci Series

EasyPython00:00

Practice interviewer

In session

5 left

00:00

Your question is Print Fibonacci Series. Start with the requirements on the right.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

You need to log in / sign up to run or submit.

Problem

Druva QA tooling needs a predictable Fibonacci sequence for validating backup scheduling and health-check calculations. Given a non-negative integer n, return the first n Fibonacci numbers, starting with 0, 1.

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

Formal Specification

Implement fibonacci(n), where:

Input: An integer n representing the requested sequence length.
Output: A list of exactly n integers containing the Fibonacci sequence from index 0 through index n - 1.

Constraints

0 <= n <= 30
n is an integer
Return exactly n Fibonacci values
Use F(0) = 0 and F(1) = 1

Function Signature

def fibonacci(n):

Your solutionPython 3

You need to log in / sign up to run or submit.

Run your code to see test output