Day 40: Dynamic Programming - 2D Problems

After reading this chapter and engaging in the embedded activities and reflections, you should be able to:

• Set up two-dimensional DP tables for problems with two parameters
• Solve grid traversal problems using 2D DP
• Implement longest common subsequence algorithm
• Solve edit distance problem with dynamic programming
• Understand and implement the 0/1 knapsack problem
• Reconstruct solution paths from 2D DP tables
• Identify when problems require 2D state space