PythonEasyNumbers10 min
Generate the Fibonacci series
Each later term is the sum of the previous two. For n = 0, print an empty line. Interviewers use this problem to assess carry the last two terms forward instead of recomputing prefixes.
Input
One integer n.
Output
Print the result values separated by single spaces; print an empty line for an empty result.
Constraints
0 <= n <= 200.
Example
Input
7
Output
0 1 1 2 3 5 8
Example 2 input
50
Output
0 1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 987 1597 2584 4181 6765 10946 17711 28657 46368 75025 121393 196418 317811 514229 832040 1346269 2178309 3524578 5702887 9227465 14930352 24157817 39088169 63245986 102334155 165580141 267914296 433494437 701408733 1134903170 1836311903 2971215073 4807526976 7778742049
Later terms exceed 32-bit integer range.
Public test cases (2)
Input
7
Expected output
0 1 1 2 3 5 8
Input
2
Expected output
0 1
Hints (2)
- Identify the state needed to avoid repeated work.
- Carry the last two terms forward instead of recomputing prefixes.
Target complexity: time O(n) arithmetic operations · space O(n) output integers