-
Notifications
You must be signed in to change notification settings - Fork 4
Dynamic Programming
Suyash Soni edited this page Mar 19, 2018
·
15 revisions
- To find out the number of BSTs can be formed with 'n' sorted elements/keys
- Check if array can be partitioned into two subsets such that the sum of elements in both subsets is same
- Coin change problem
- Knapsack 0-1 problem
- Longest common sub-sequence(LCS)
- Longest repeated sub-sequence(LRS)
- Longest increasing sub-sequence(LIS)
- Subset-sum problem
- Cutting rod into pieces to maximize profit
- Square sub-matrix with maximum consecutive 1's
- Minimum jump(s) required to reach at the end of the array
- Number of ways to reach some position in matrix(moves: right, bottom)
- Ugly numbers
- Super-Ugly numbers
- Weighted-job-scheduling
- Minimum Number of Platforms Required for a Railway/Bus Station