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 1407 / 1438 800
Buying tickets 1113 / 1129 800
Reading 2 935 / 996 800
Longest increasing subsequence 1153 / 1169 900
Jealousy 817 / 945 900
Maximum path 2 987 / 998 1000
Fences painting 616 / 684 1000
Hall 553 / 632 1000
Knapsack 2 834 / 875 1100
Longest common subsequence 750 / 768 1100
Yet another build array problem 521 / 556 1100
Rectangle cutting 530 / 579 1100
Palindrome query 612 / 631 1100
Marisa 514 / 537 1100
Merging elements 468 / 535 1200
Brewing potion 8 412 / 431 1200