dsa1 min read
Target Sum — DP Count Ways
Assign + or - to each number to reach target sum. DP counts ways to reach each sum. Reduces to 0/1 knapsack subset sum count.
Read →
All Posts
1575 articles
dsa1 min read
Longest Common Subsequence — 2D DP Preview
LCS of two strings: dp[i][j] = LCS of first i chars of s1 and first j chars of s2. Full 2D DP treatment in the 2D DP section.
Read →
dsa2 min read
1D Dynamic Programming — Master Recap & Cheatsheet
Complete 1D DP cheatsheet: 8 patterns, key transitions, complexity table, and problem index.
Read →
dsa4 min read
2D Dynamic Programming — Complete Guide
Master 2D DP: LCS, Edit Distance, grid path counting, matrix chain, interval DP, and stock patterns with 5-language templates.
Read →
dsa1 min read
Unique Paths — Grid Path Count DP
Count paths from top-left to bottom-right moving only right or down. dp[i][j] = dp[i-1][j] + dp[i][j-1]. Math formula O(1) also works.
Read →
Page 98 of 315