What is dynamic programming and how can we learn it?

Answer 1

will memory become any issue if it takes a large values?
how can a question be identified as a DP question and how can we create a pattern to come up with a solution ?

Answer 2

ask google about it.

Answer 3

Dynamic programming approach is similar to divide and conquer in breaking down the problem into smaller and yet smaller possible sub-problems. But unlike, divide and conquer, these sub-problems are not solved independently. Rather, results of these smaller sub-problems are remembered and used for similar or overlapping sub-problems.

Dynamic programming is used where we have problems, which can be divided into similar sub-problems, so that their results can be re-used. Mostly, these algorithms are used for optimization. Before solving the in-hand sub-problem, dynamic algorithm will try to examine the results of the previously solved sub-problems. The solutions of sub-problems are combined in order to achieve the best solution.

Answer 4

With regards of pattern to come up with a solution if I'm not wrong there is not a general approach but the formula for every subproblem is specific for every problem to solve.

Answer 5

That's a good point, computational efficiency of dynamic programming has a price, its memory space consumption.