When To Use 2D Over 1D Tables In Dynamic Programming | Longest Common Subsequence Problem

In this video we look at when 2-dimensional tables need to be used over 1-dimensional tables for bottom up dynamic programming problems, with specific reference to the longest common subsequence problem and comparing knapsack with repetition to the 0/1 knapsack problem.