Tech_Interview_Prep

2-D Dynamic Programming

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

Practice MCQs for this concept are coming soon.