Generate the Fibonacci sequence
Return the first n Fibonacci numbers starting with 0 and 1, where 0 <= n <= 50. Inputs are valid JSON and must not be modified unless the algorithm uses a local copy. This exercise probes typed data modeling, boundary handling, and algorithm selection.
Input
One JSON value: number. See the sample for its exact shape.
Output
One compact JSON value of type number[]. Strings include JSON quotes; arrays preserve the specified order.
Constraints
Array/string lengths are 0 to 10000 unless stated otherwise. Numbers are integers in [-1000000,1000000]; all computed results fit the safe integer range.
Example
Input
7
Output
[0,1,1,2,3,5,8]
Example 2 input
10
Output
[0,1,1,2,3,5,8,13,21,34]
Checks a boundary or contrasting case beyond the public examples.
Public test cases (2)
Input
7
Expected output
[0,1,1,2,3,5,8]
Input
0
Expected output
[]
Hints (2)
- Start with the required output order and the empty-input behavior.
- Carry the previous two sequence values
Target complexity: time O(n) · space O(n)
