Given a non-negative integer n, return the nth Fibonacci number. The Fibonacci sequence is defined as F(0) = 0, F(1) = 1, and F(n) = F(n - 1) + F(n - 2) for n >= 2. The function should return a single integer.
Constraints
0 <= n <= 30
n is an integer
Return the exact Fibonacci value
Function Signature
deffibonacci(n):
Interviewer
Your question is Nth Fibonacci Number. Start with the requirements in the Question tab.
Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.
