Check out this set of videos by Brian Dean that explain solutions to well known dynamic programming problems. This includes the longest increasing subsequence, knapsack problem and maximum value contiguous subsequence.
Tag Archives: dynamic programming
Subset Sum and Dynamic Programming
In this blog post we will have a look at the subset sum problem and examine the solution via dynamic programming. Continue reading