Archive: dynamic-programming
-
» Number of ways to make change for an amount (coin change)
-
» Maximum and minimum sum subsequences at a distance M
-
» Count matrix paths from TopLeft to BottomRight
-
» Shortest squares sum
-
» Cellphone base covering problem
-
» Maximize gain by choosing numbers from array ends
-
» Inserting whitespaces between words
-
» Solutions for a linear equation
-
» Calculating binomial coefficients
-
» Minimum coin change
-
» Bitonic tour
-
» Select/Copy/Paste problem
-
» Longest increasing subsequence
-
» Function approximation
-
» Longest subset which sums to zero
-
» Box stacking problem
-
» Dice throw problem
-
» Counting boolean parenthesizations
-
» Minimum number of jumps
-
» Longest common subsequence
-
» Interval scheduling
-
» Edit distance problem
-
» All pairs shortest path and transitive closure
-
» Counting roundtrip paths in a graph given a number of steps
-
» Optimal binary search tree
-
» Knapsack problem
-
» Matrix chain multiplication - MCOP