Fibonacci Number
Problem statement
Return the n-th Fibonacci number, where F(0)=0, F(1)=1, and F(n)=F(n-1)+F(n-2).
Function
fibonacci(n: int) → longExamples
Example 1
n = 2return = 1F(2)=F(1)+F(0)=1.
Example 2
n = 10return = 55The tenth Fibonacci number is 55.
Constraints
0 <= n <= 91.