Dynamic-Programming-Problems

This repository contains all the standard DP variations along with similar problems based on each of these parent questions.

Name		Name	Last commit message	Last commit date
Latest commit History 36 Commits
1 0-1 knapsack		1 0-1 knapsack
1.1 0-1 knapsack problems(6)		1.1 0-1 knapsack problems(6)
2 Unbounded Knapsack		2 Unbounded Knapsack
2.1 Unbounded Knapsack problems(4)		2.1 Unbounded Knapsack problems(4)
3 Longest Common Subsequence (LCS)		3 Longest Common Subsequence (LCS)
3.1 LCS problems		3.1 LCS problems
4 Matrix Chain Multiplication (MCM)		4 Matrix Chain Multiplication (MCM)
4.1 MCM problems		4.1 MCM problems
5 DP on Trees		5 DP on Trees
5.1 DP on Trees problems		5.1 DP on Trees problems
.gitignore		.gitignore
README.md		README.md
top-down DP vs Bottom-up DP.txt		top-down DP vs Bottom-up DP.txt

Provide feedback