Skip to content

Latest commit

 

History

History
28 lines (15 loc) · 440 Bytes

File metadata and controls

28 lines (15 loc) · 440 Bytes

Fibonacci Series

Write a function that returns the first n numbers of the Fibonacci sequence.
The Fibonacci sequence starts from 0 and 1, and each number is the sum of the two preceding ones.


Example:

Input: 5 Output: [0, 1, 1, 2, 3]

Input: 8 Output: [0, 1, 1, 2, 3, 5, 8, 13]


Problem added by

SaadQasim19


Solution

Click here to see the solution