dsa1 min read
Unique Paths II — Grid with Obstacles
Count paths avoiding obstacle cells. Same DP but obstacles block cell (dp[i][j]=0) and obstacle at start/end returns 0.
Read →
All Posts
1575 articles
dsa1 min read
Minimum Path Sum — Grid DP
Find minimum cost path from top-left to bottom-right moving right or down. dp[i][j] = grid[i][j] + min(dp[i-1][j], dp[i][j-1]).
Read →
dsa1 min read
Triangle — Bottom-Up 1D DP
Minimum path sum from top to bottom of triangle. Bottom-up DP: dp[j] = triangle[i][j] + min(dp[j], dp[j+1]).
Read →
dsa1 min read
Longest Common Subsequence — LCS 2D DP
Classic LCS: dp[i][j] = LCS length of s1[:i] and s2[:j]. If chars match add 1 to diagonal; else take max of skip either string.
Read →
dsa1 min read
Edit Distance — Wagner-Fischer DP
Minimum operations (insert, delete, replace) to transform word1 to word2. Classic Wagner-Fischer 2D DP with O(n) space optimization.
Read →
Page 99 of 315