Basic-Dynamic-Programming This repository includes codes for finding the entire solution of the following basic dynamic programming problems. 0/1 knapsack longest common subsequence longest increasing subsequence minimum coins subset sum All the codes are implemented in c++.