Loading...
Engaged employer
Write a program that outputs the Fibonacci sequence.
Anonymous
There's a non-efficient O(n^2) way that uses recursion. There's an efficient O(n) way that uses an array.
Check out your Company Bowl for anonymous work chats.
Get actionable career advice tailored to you by joining more bowls.
Stay ahead in opportunities and insider tips by following your dream companies.
Get personalised job recommendations and updates by starting your searches.