Динамическое программирование было сложной задачей, пока я не изучил эти 20 паттернов
1. Fibonacci Sequence
2. Kadane's Algorithm
3. 0/1 Knapsack
4. Unbounded Knapsack
5. Longest Common Subsequence (LCS)
6. Longest Increasing Subsequence (LIS)
7. Palindromic Subsequence
8. Edit Distance
9. Subset Sum
10. String Partition
11. Catalan Numbers
12. Matrix Chain Multiplication
13. Count Distinct Ways
14. DP on Grids
15. DP on Trees
16. DP on Graphs
17. Digit DP
18. Bitmasking DP
19. Probability DP
20. State Machine DP
1. Fibonacci Sequence
2. Kadane's Algorithm
3. 0/1 Knapsack
4. Unbounded Knapsack
5. Longest Common Subsequence (LCS)
6. Longest Increasing Subsequence (LIS)
7. Palindromic Subsequence
8. Edit Distance
9. Subset Sum
10. String Partition
11. Catalan Numbers
12. Matrix Chain Multiplication
13. Count Distinct Ways
14. DP on Grids
15. DP on Trees
16. DP on Graphs
17. Digit DP
18. Bitmasking DP
19. Probability DP
20. State Machine DP
Скрытое содержимое могут видеть только пользователи групп(ы): Premium, Местный, Свои