← Recursion & DP
Recursion & DP Target: 10s
Bottom-up 1D DP builds solutions iteratively. Avoids recursion depth limits.
dp = [0] * (n + 1) for i in range(1, n + 1): dp[i] = ... # recurrence
Type it from memory. Go.