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

preview_player
Показать описание
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.
Рекомендации по теме
Комментарии
Автор

Your ability to explain complexity with simplicity is commendable. Very underrated channel. Please make more videos on other algorithms such as divide and conquer, backtracking or graph algorithms.

rishabhmehta
visit shbcf.ru