There are several programms that focuses on problem solving using dynamic programming in python and C++

• 01_knapsack (3 approaches):

  1.Using Recursion

  2.Using Recursion+Memoization

  3.Using Dynamic Programming

• Unbounded Knapsack :- Maximum Profit achieved by including items for multiple number of times

• Coin change :- number of ways given sum can be obtained from denominations of coins

• Subset Sum

  1.Subset Sum using dp related to knapsack approach

  2.Leetcode Problem of Partition Equall Subset Sum :- Partition subset into 2 equall parts

  3.Subset Sum Count :- Count number of subset from array given sum k

• String

  1.Longest Common Subsequence(lcs.py)

  2.Longest Common Subsequence pattern print(lcs_pattern_print.py)

  3.Longest Common Substring