Dynamic programming basically approach it's similar to divide and also conquer in breaking down the problem into smaller and also 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.
In reply to MD.TORIKUL ISLAM ( 192-15-2852 ) EMON
Re: Dynamic programming
Example: The following computer problems can be solved using dynamic programming approach −
- Fibonacci number series
- Knapsack problem
- Shortest path
- DP coin change problem
20 words
In reply to MD.TORIKUL ISLAM ( 192-15-2852 ) EMON
Re: Dynamic programming
Three basic concepts of Dynamic Programming :
- Tabulation vs Memoizatation
- Optimal Substructure Property
- Overlapping Subproblems Property
13 words