Dsa
Math
Easy
Fibonacci Performance
Write a function that computes the n-th Fibonacci number. The Fibonacci sequence is defined as follows: F(0) = 0, F(1) = 1, and F(n) = F(n-1) + F(n-2) for n >= 2.
Example Input:
6
Example Output:
8
Key concepts
fibonaccirecursiondynamic programming
Practise this out loud — free
Start a mock interview on THIS exact question — a voice AI interviewer opens with it, pushes back like a real onsite, then hands you an instant scorecard.
🎙 Practise this question now