- 0-1 Knapsack problem
- coin change
- partition equal sum subset
- Target sum
- Longest Increasing Subsequence
- Longest common Subsequence
- Longest Palindrome Substring/Subsequence
- Longest common Substring
- Combination sum 4/Stair case problem
- Decode ways

- 0-1 Knapsack problem
- coin change
- partition equal sum subset
- Target sum
- Longest Increasing Subsequence
- Longest common Subsequence
- Longest Palindrome Substring/Subsequence
- Longest common Substring
- Combination sum 4/Stair case problem
- Decode ways