Back to Topics
Dynamic Programming
Your Progress
Progress
0%
Total Problems
60
Completed
0
Status | Problem | Bookmark | Notes | Actions |
---|---|---|---|---|
Coin ChangeProblem | ||||
Knapsack Problem | ||||
Binomial CoefficientProblem | ||||
Permutation CoefficientProblem | ||||
Program for nth Catalan Number | ||||
Matrix Chain Multiplication | ||||
Edit Distance | ||||
Subset Sum Problem | ||||
Friends Pairing Problem | ||||
Gold Mine Problem | ||||
Assembly Line SchedulingProblem | ||||
Painting the Fenceproblem | ||||
Maximize The Cut Segments | ||||
Longest Common Subsequence | ||||
Longest Repeated Subsequence | ||||
Longest Increasing Subsequence | ||||
Space Optimized Solution of LCS | ||||
LCS (Longest Common Subsequence) of three strings | ||||
Maximum Sum Increasing Subsequence | ||||
Count all subsequences having product less than K | ||||
Longest subsequence such that difference between adjacent is one | ||||
Maximum subsequence sum such that no three are consecutive | ||||
Egg Dropping Problem | ||||
Maximum Length Chain of Pairs | ||||
Maximum size square sub-matrix with all 1s | ||||
Maximum sum of pairs with specific difference | ||||
Min Cost PathProblem | ||||
Maximum difference of zeros and ones in binary string | ||||
Minimum number of jumps to reach end | ||||
Minimum cost to fill given weight in a bag | ||||
Minimum removals from array to make max –min <= K | ||||
Longest Common Substring | ||||
Count number of ways to reacha given score in a game | ||||
Count Balanced Binary Trees of Height h | ||||
LargestSum Contiguous Subarray [V>V>V>V IMP ] | ||||
Smallest sum contiguous subarray | ||||
Unbounded Knapsack (Repetition of items allowed) | ||||
Word Break Problem | ||||
Largest Independent Set Problem | ||||
Partition problem | ||||
Longest Palindromic Subsequence | ||||
Count All Palindromic Subsequence in a given String | ||||
Longest Palindromic Substring | ||||
Longest alternating subsequence | ||||
Weighted Job Scheduling | ||||
Coin game winner where every player has three choices | ||||
Count Derangements (Permutation such that no element appears in its original position) [ IMPORTANT ] | ||||
Maximum profit by buying and selling a share at most twice [ IMP ] | ||||
Optimal Strategy for a Game | ||||
Optimal Binary Search Tree | ||||
Palindrome PartitioningProblem | ||||
Word Wrap Problem | ||||
Mobile Numeric Keypad Problem [ IMP ] | ||||
Boolean Parenthesization Problem | ||||
Largest rectangular sub-matrix whose sum is 0 | ||||
Largest area rectangular sub-matrix with equal number of 1’s and 0’s [ IMP ] | ||||
Maximum sum rectangle in a 2D matrix | ||||
Maximum profit by buying and selling a share at most k times | ||||
Find if a string is interleaved of two other strings | ||||
Maximum Length of Pair Chain |