Micro-Drill #96 — Fibonacci DP

Recursion & DP Target: 10s

Fibonacci DP is the simplest recurrence. Same pattern as climbing stairs.

dp = [0] * (n + 1)
dp[1] = 1
for i in range(2, n + 1):
    dp[i] = dp[i - 1] + dp[i - 2]

Type it from memory. Go.