Return the `13`th Fibonacci number (0-indexed: F(0)=0, F(1)=1). Variant **#8**.
Example 1
Input: n = 13
Output: 233
Constraints
Acceptance: 70% · Topics: math, dynamic-programming, recursion
← All practice problems