Back to Paths
🧠
Dynamic Programming Patterns
A pattern-first tour of DP: 1-D states, string DP, knapsack-style counting and interval DP — with editorials for every problem.
3
Modules
18h
Duration
14
Students
500
Coins Reward
Course Modules
1
1-D DP
One index, one answer.
2
String DP
Two strings, a 2-D table — usually compressible to one row.
3
Counting and intervals
Knapsack-style counting and choosing the last action.