AbdoGad's blog

By AbdoGad, history, 2 years ago, In English

I try to be better in dp and saw so much videos and I am still not good in dp I try to solve problems but I find it hard to come up with a dp solution

  • Vote: I like it
  • +7
  • Vote: I do not like it

| Write comment?
»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Only Solution: Practice more problems. Keep the ideas in mind. Repeat.

»
2 years ago, # |
  Vote: I like it +12 Vote: I do not like it

Something that helped me is that I stopped looking at tutorials and videos on "How to get good at DP?" and started working more on problems. It gets very easy to get caught in the "Tutorial Loop" and not practice enough.

Also it is slightly tough to grasp to concept of building recurrences but don't worry you'll get it eventually.

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

I am not a pro at dp but what has worked for me is to come up with a brute force solution and see what you are calculating again and again. Then memorize that aspect of the problem. I dunno if it works everywhere but it can be your starting point.

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

The main thing is to learn to understand where dp is)

»
2 years ago, # |
  Vote: I like it +10 Vote: I do not like it

ok ok ok ok ive seen "how to get better at DP" blogs for years at this point. It, and hear me out, MIGHT be a good idea to use the search bar at the top right and search up: "dynamic programming" and search to find the answer you need.

  • »
    »
    2 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    thx for your reply sry I will use it next time.

»
2 years ago, # |
  Vote: I like it +3 Vote: I do not like it

firstly learn those 20 to 30 standard dp problem after that start practicing and try to relate each dp problem solution with standard problems,you will notice generally the same concepts repeat(eg if you like recursive dp then try to solve each dp problem in recursive way or lookout for some recursive solution and same for iterative) . if you want to practice dp, solve it through dp+constructive+greedy tag so it will teach you to differentiate between greedy and dp

i feel this should work ,please correct me if i am wrong at some points