Please read the new rule regarding the restriction on the use of AI tools. ×

_APM's blog

Facing difficulties on solving DP Problem of rating 1600-1800
By _APM, history, 2 years ago, In English

I am facing difficulties on solving dp problem of question with rating 1600+ . Please suggest me some resources by which I can solve the problems based on DP in range 1600-1800.

  • Vote: I like it
  • 0
  • Vote: I do not like it

Comments Comments (3)
| Write comment?
»
2 years ago, # |
← Rev. 3   Vote: I like it 0 Vote: I do not like it

CSES and its editorial

→ Reply
»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Just check the introduction dp page under the USACO Guide gold section.

→ Reply
»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

To get good at dp I did some LeetCode hard dp problems and Hackerrank dp problems. But I think for 1600-1800 problems you only need to know basic DP and Knapsack DP, + reconstruction of an optimal solution. But it's fun to learn the other common ones like bitmask DP, digit DP, etc.

→ Reply