EasyVery High Frequency25 min
1D DP — Fibonacci & Climbing Stairs
Classic linear DP patterns with state as a single value.
1D DP: state is a single index. Classic problems: house robber, coin change, word break. Define dp[i] clearly, write recurrence, fill forward.
1D Dynamic Programming
More in Dynamic Programming
DP Fundamentals
Memoization vs tabulation, overlapping subproblems, and optimal substructure.
2D DP — Grid & Substring Problems
Unique paths, edit distance, LCS — learn to model 2D state transition tables.
0/1 Knapsack & Unbounded Knapsack
The most important DP sub-category — choose items with weight/value constraints.