Generate an infinite Fibonacci sequence using Enumerator::Lazy and retrieve the first `n` Fibonacci numbers.

Hard

Generate an infinite Fibonacci sequence using Enumerator::Lazy and retrieve the first n Fibonacci numbers.

n = 10

[0, 1, 1, 2, 3, 5, 8, 13, 21, 34]

Time: 2s · Memory: 256 MB

Code Editor

00:00

def fibonacci_lazy(n) # Your code here end puts fibonacci_lazy(10)

Input

n = 10

Expected Output

[0, 1, 1, 2, 3, 5, 8, 13, 21, 34]

Custom Input (stdin)

Program Output

> Run your code to see console output.

Programming Exercises