Problem

Implement a Python function that returns the first n numbers in the Fibonacci sequence as a list of integers. The sequence starts with 0, 1, and each later number is the sum of the previous two. If n is 0, return an empty list.

Constraints

• 0 <= n <= 10^5
• Return the sequence in order from first to last
• Use an approach efficient enough to avoid repeated recomputation