1D Dynamic Programming Problems: Classic Patterns
Learn to solve common 1D dynamic programming problems including climbing stairs, house robber, and coin change with optimized space solutions.
Posts tagged with #dynamic-programming
2D Dynamic Programming: Matrix Chain and Beyond
Master 2D DP problems with two state variables for string manipulation, matrix chain multiplication, and optimal game strategies.
DP on Trees and Graphs: Tree DP and Graph DP
Apply dynamic programming to tree and graph structures using DFS-based state propagation for optimal subtree and path calculations.
DP States and Transitions: Building Optimal Solutions
Learn how to identify optimal substructure, define DP state variables, and formulate recurrence relations correctly.
Dynamic Programming: From Memoization to Optimal Solutions
Master dynamic programming fundamentals including memoization, tabulation, and how to identify DP subproblems.
Edit Distance: Transforming One String to Another
Solve the minimum edit distance problem using dynamic programming with applications in spell checking, DNA alignment, and autocomplete.
Knapsack Problem Variants
Master the 0/1, unbounded, and fractional knapsack variants with DP solutions and optimization techniques for resource allocation problems.
Longest Common Subsequence: String Alignment Problems
Master the classic DP problem for string similarity, diff tools, and bioinformatics with O(mn) time and space optimization techniques.
Longest Increasing Subsequence: Patience Sorting
Find the longest strictly increasing subsequence in O(n log n) time using patience sorting and binary search techniques.
Memoization vs Tabulation: Two Faces of Dynamic Programming
Understand the two fundamental DP approaches—top-down with memoization and bottom-up with tabulation—plus hybrid techniques like the/m on the fly.