Dynamic programming

Question

How to approach DP problems ?. Give a simple explanation on how to construct and approach dynamic programming.

Answer 1

you can search on a lot of competitive programming websites for dp problems. most of them will be about travelling salesman, knapsack, and some memoization techniques. u can find a lot of tutorials about that in the internet.

Answer 2

yes, mostly what will be shown on tutorials are theory on solving them and examples.

but once you're doing competitive programming yourself, you will need critical thinking on what algorithms to use and how to implement it yourself on this problem.

Answer 3

Thanks but Is there a general way to attack those problems or is it all about experience coming from practice ? lvl 1 crook