Generate Fibonacci Sequence — LeetCode 2648 Python Solution
EasyJavaScript
- Problem
- #2648
- Reading time
- 2 min
- Source
- leetcode.com
The problem
Write a generator function that returns a generator object which yields the fibonacci sequence. The fibonacci sequence is defined by the relation Xn = Xn-1 + Xn-2.
Example
- Input
- callCount = 5
- Output
- [0,1,1,2,3]
- Explanation
- const gen = fibGenerator();
Complexity
| Measure | Complexity |
|---|---|
| Time | O(n) |
| Space | O(1) to O(n) auxiliary |
Related problems
Frequently asked questions
- How hard is LeetCode 2648. Generate Fibonacci Sequence?
- LeetCode 2648. Generate Fibonacci Sequence is rated Easy on LeetCode.
- What topics does LeetCode 2648. Generate Fibonacci Sequence cover?
- LeetCode 2648. Generate Fibonacci Sequence is tagged JavaScript on LeetCode.