Get started
Start with DSA Fundamentals
Programming Fundamentals
Back to modulesModule 16 · 0/56
Module 16
Dynamic Programming
0/5602036
Introduction to DP0/1
1D DP0/5
2D/3D DP and Grids0/7
DP on Subsequences0/11
- 1Subset Sum Equal to TargetMed.
- 2Partition Equal Subset SumMed.
- 3Partition Set Into 2 Subsets With Min Absolute Sum DiffMed.
- 4Count Subsets with Sum KMed.
- 5Count Partitions with Given DifferenceMed.
- 60/1 KnapsackHard
- 7Minimum CoinsHard
- 8Target SumMed.
- 9Coin Change IIHard
- 10Unbounded KnapsackHard
- 11Rod Cutting ProblemHard
DP on Strings0/10
- 1Longest Common SubsequenceHard
- 2Print Longest Common SubsequenceHard
- 3Longest Common SubstringHard
- 4Longest Palindromic SubsequenceHard
- 5Minimum Insertions to Make String PalindromeHard
- 6Minimum Insertions/Deletions to Convert StringHard
- 7Shortest Common SupersequenceHard
- 8Distinct SubsequencesHard
- 9Edit DistanceHard
- 10Wildcard MatchingMed.