Module Introduction to dynamic programming

Introduction to dynamic programming

**Frequency: 100/10** Dynamic programming (DP) is a crucial technique in Competitive Programming, with DP problems commonly appearing in various contests. While there is no definitive formula for solving DP problems, the good news is that they often exhibit common characteristics. By practicing your skills, you can develop the ability to quickly identify the DP state, a crucial step towards effectively tackling these problems.

Resources

- [Youtube Reducible: 5 Simple Steps for Solving Dynamic Programming Problems](https://www.youtube.com/watch?v=aPQY__2H3tE)

Problems

Hakurei Shrine 2036 / 2075 800
Buying tickets 1682 / 1703 800
Reading 2 1369 / 1438 800
Longest increasing subsequence 1668 / 1695 900
Jealousy 1201 / 1339 900
Maximum path 2 1427 / 1441 1000
Fences painting 997 / 1068 1000
Hall 880 / 976 1000
Knapsack 2 1205 / 1262 1100
Longest common subsequence 1081 / 1103 1100
Yet another build array problem 773 / 809 1100
Rectangle cutting 763 / 825 1100
Palindrome query 879 / 906 1100
Marisa 727 / 755 1100
Merging elements 694 / 774 1200
Brewing potion 8 639 / 661 1200