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