Tech_Interview_Prep

2-D Dynamic Programming

DP where the subproblem needs two indices — grid paths, two-string comparisons, and knapsack-style capacity constraints.

Reference Q&A for this concept is coming soon.