Skip to content
AlgoVisual

Fibonacci Number

LeetCode

01 · Question

The Fibonacci numbers are defined as:

  • F(0) = 0
  • F(1) = 1
  • F(n) = F(n-1) + F(n-2) for n > 1

Given n, calculate F(n).

02 · Solution

Reference solution

1def fib(n: int) -> int:
2    if n <= 1:
3        return n
4    return fib(n - 1) + fib(n - 2)
Next
Pow(x, n)