Optimal Substructure Property – Dynamic Programming – A problem has Optimal Substructure Property if optimal solution of the given problem can be obtained
dynamic programming problems and solutions
2 Articles
2
Greedy Algorithm to find Minimum number of Coins – Greedy Algorithm – Given a value V, if we want to make change for V Rs. and we have infinite supply of each of the denominations in Indian currency.