Write a function that returns a list containing the first 'n' elements of the Fibonacci sequence. The sequence starts with 0 and 1, and every subsequent number is the sum of the two preceding ones.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.