Following are few examples/problems that can be solved using Dynamic Programming.
These are few problems that are frequently asked in some of the interviews.
Coin Change Problem
Maximum Contiguous SubSequence sum
Longest Increasing SubSequence Problem
Cutting Rod for Best Price
Max no of making an Amount
Minimum No of steps to reach the end of array
No comments:
Post a Comment