geeksforgeeks Top 20 Dynamic Programming Interview Questions

1、 Longest Common Subsequence

最长公共子序列

2、 Longest Increasing Subsequence

最长递增子序列

3、 Edit Distance

编辑距离

4、 Minimum Partition

5、 Ways to Cover a Distance

6、 Longest Path In Matrix

7、 Subset Sum Problem

子集和问题

8、 Optimal Strategy for a Game

9、 0-1 Knapsack Problem

10、 Boolean Parenthesization Problem

11、 Shortest Common Supersequence

12、 Matrix Chain Multiplication

13、 Partition problem

14、 Rod Cutting

15、 Coin change problem

16、 Word Break Problem

17、 Maximal Product when Cutting Rope

18、 Dice Throw Problem

19、 Box Stacking

20、 Egg Dropping Puzzle

高楼扔鸡蛋

TODO

geeksforgeeks Longest Common Increasing Subsequence (LCS + LIS)