Fibonacci

## How Fibonacci with DP Works

The Fibonacci sequence is a classic example for demonstrating dynamic programming. Instead of redundant recursive calls, we store computed values.

### Algorithm Steps (Bottom-Up):
1. Initialize base cases: F(0) = 0, F(1) = 1
2. For each n from 2 to target:
- Calculate F(n) = F(n-1) + F(n-2)
- Store result in memoization table
3. Return F(target)

### Key Characteristics:
- **Memoization**: Store computed values to avoid recalculation
- **Optimal Substructure**: F(n) depends on F(n-1) and F(n-2)
- **Overlapping Subproblems**: Same subproblems solved multiple times in naive recursion