ā£
ā£
ā£
ā£
ā£
ā£
ā£
ā£
ā£
ā£
ā£
04-dynamic-programming.pdf171.6KB
What are the steps for solving a dynamic programming problem?
What kinds of dynamic programming problems are there?
What is the recurrence for the (longest common subsequence) problem?
What is the recurrence for the LPS (longest palindromic subsequence) problem?
What is the recurrence for the LRS (longest repeated subsequences) problem?
What is the recurrence for the SCS (shortest common supersequence) problem?
What is the recurrence for the LIS (longest increasing subsequence) problem?
What is the recurrence for the Matrix Chain Multiplication problem?
0-1 Knapsack problem (discrete)
0-1 Knapsack problem (continuous)
Diff Utility