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 983 / 1017 800
Buying tickets 732 / 743 800
Reading 2 636 / 689 800
Longest increasing subsequence 809 / 825 900
Jealousy 594 / 689 900
Maximum path 2 686 / 695 1000
Fences painting 412 / 472 1000
Hall 372 / 435 1000
Knapsack 2 605 / 634 1100
Longest common subsequence 549 / 561 1100
Yet another build array problem 377 / 407 1100
Rectangle cutting 381 / 418 1100
Palindrome query 429 / 440 1100
Marisa 352 / 372 1100
Merging elements 342 / 392 1200
Brewing potion 8 290 / 305 1200