Grokking Dynamic Programming Patterns for Coding Interviews |
---|
【动态规划专题班】动态规划入门 Introduction to Dynamic Programming | 动态规划的套路 by wisdompeak | ACM大神是怎么解决动态规划的?搞定DP看这就够了 |
---|
青云算法动态规划专题讲座 | 动态规划(重置版) |
---|
背包问题九讲 |
---|
- 动态规划
-
动态规划的问题
- 0/1 Knapsack, 0/1背包,6个题
- 0/1 Knapsack,0/1背包问题
- Equal Subset Sum Partition,相等子集划分问题
- Subset Sum,子集和问题
- Minimum Subset Sum Difference,子集和的最小差问题
- Count of Subset Sum,相等子集和的个数问题
- Target Sum,寻找目标和的问题
- Unbounded Knapsack,无限背包,5个题
- Unbounded Knapsack,无限背包
- Rod Cutting,切钢条问题
- Coin Change,换硬币问题
- Minimum Coin Change,凑齐每个数需要的最少硬币问题
- Maximum Ribbon Cut,丝带的最大值切法
- Fibonacci Numbers,斐波那契数列,6个题
- Fibonacci numbers,斐波那契数列问题
- Staircase,爬楼梯问题
- Number factors,分解因子问题
- Minimum jumps to reach the end,蛙跳最小步数问题
- Minimum jumps with fee,蛙跳带有代价的问题
- House thief,偷房子问题
- Palindromic Subsequence,回文子系列,5个题
- Longest Palindromic Subsequence,最长回文子序列
- Longest Palindromic Substring,最长回文子字符串
- Count of Palindromic Substrings,最长子字符串的个数问题
- Minimum Deletions in a String to make it a Palindrome,怎么删掉最少字符构成回文
- Palindromic Partitioning,怎么分配字符,形成回文
- Longest Common Substring,最长子字符串系列,13个题
- Longest Common Substring,最长相同子串
- Longest Common Subsequence,最长相同子序列
- Minimum Deletions & Insertions to Transform a String into another,字符串变换
- Longest Increasing Subsequence,最长上升子序列
- Maximum Sum Increasing Subsequence,最长上升子序列和
- Shortest Common Super-sequence,最短超级子序列
- Minimum Deletions to Make a Sequence Sorted,最少删除变换出子序列
- Longest Repeating Subsequence,最长重复子序列
- Subsequence Pattern Matching,子序列匹配
- Longest Bitonic Subsequence,最长字节子序列
- Longest Alternating Subsequence,最长交差变换子序列
- Edit Distance,编辑距离
- Strings Interleaving,交织字符串
- 0/1 Knapsack, 0/1背包,6个题
-
背包问题系列
-
打家劫舍系列
-
股票系列
-
子序列系列
-