Fibonacci sequence
Task
F(0) = 0, F(1) = 1, F(n) = F(n−1) + F(n−2). Write fib(n) and explain the complexity. The interviewer expects an evolution of the solution, not a single version.
The rest of this answer, with code and interview follow-ups, is in the DevPrep app.
Read the full answer in DevPrep