// Fibonacci Number — EASY

// Category: dynamic-programming

The **Fibonacci numbers** form a sequence: `F(0) = 0`, `F(1) = 1`, and `F(n) = F(n - 1) + F(n - 2)` for `n > 1`.

Given `n`, compute `F(n)`.

Hint: For efficiency, use bottom-up DP — just two variables are enough instead of recursion or a full array.

Example: n = 2

Output: 1