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 1844 / 1880 800
Buying tickets 1517 / 1536 800
Reading 2 1243 / 1309 800
Longest increasing subsequence 1514 / 1532 900
Jealousy 1095 / 1231 900
Maximum path 2 1301 / 1315 1000
Fences painting 894 / 962 1000
Hall 785 / 876 1000
Knapsack 2 1096 / 1144 1100
Longest common subsequence 981 / 1001 1100
Yet another build array problem 695 / 733 1100
Rectangle cutting 684 / 744 1100
Palindrome query 796 / 824 1100
Marisa 666 / 690 1100
Merging elements 635 / 712 1200
Brewing potion 8 566 / 589 1200