- 0-1 Knapsack Problem
- Bursting Balloons to Maximize Value
- Coin Change (count number of ways)
- Min Number of Coins to Make a Given Value O(n) Space
- Min Number of Coins to Make a Given Value O(n^2) Space
- Total Number of Possible Binary Search Trees With N Keys
- Count Number of Ways to Reach the N'th Stair
- Cutting a Rod Problem
- Egg Dropping Puzzle
- Weighted Job Scheduling
- Kadane's Algorithm - Largest Sum Contiguous Subarray
- Largest Rectangular Area In a Historgram
- Longest Common Substring
- Longest Bitonic Subsequence
- Longest Increasing Subsequence
- Longest Palindromic Subsequence
- Matrix Chain Multiplication
- Max Profit Buy/Sell With K Transactions
- Max Size Rectangle With All 1s
- Min Edit Distance
- Min Cost Path
- String Interleaving Problem
- Optimal Strategy for a Game
- Box Stacking Problem
- Subset Sum Problem
- Palindrome Partitioning
- Optimal Binary Search Tree
- Max Sum Rectangle in a 2-D Matrix
- Max Sum for Not Adjacent Elements
- Word Wrap Problem
- Wild Card Pattern Matching
- Word Break Problem
- Min Number of Jumps to Reach the End
- Max Sum Increasing Subsequence
- Regular Expression Matching
- Longest Bitonic Subsequence
- Longest Common Subsequence
- Max Size Subsquare Matrix With All 1s
- Total Number of Ways
- Max Subsquare Matrix Surrounded by 'X'
- Range Sum Query in 2D Matrix in O(1) Time
- Total Number of Possible Binary Trees for a Given N
Output:
Output:
Output:
O(n) space solution
Output:
O(n^2) space solution
Output:
Output:
Output:
Output:
Output:
Output:
Output:
Output:
Output:
Output:
Output:
Output:
Output:
Output:
Output:
Output:
Output:
Output:
Output:
Output:
Output:
Output:
Output:
Output:
Output:
Output:
Output:
Output:
Output:
Output:
Output:
Output:
Output:
Output:
Output:
Output:
Output:
Output: