1 |
Dynamic Programming |
Coin ChangeProblem |
❌ |
|
|
|
2 |
Dynamic Programming |
Knapsack Problem |
❌ |
|
|
|
3 |
Dynamic Programming |
Binomial CoefficientProblem |
❌ |
|
|
|
4 |
Dynamic Programming |
Permutation CoefficientProblem |
❌ |
|
|
|
5 |
Dynamic Programming |
Program for nth Catalan Number |
❌ |
|
|
|
6 |
Dynamic Programming |
Matrix Chain Multiplication |
❌ |
|
|
|
7 |
Dynamic Programming |
Edit Distance |
❌ |
|
|
|
8 |
Dynamic Programming |
Subset Sum Problem |
❌ |
|
|
|
9 |
Dynamic Programming |
Friends Pairing Problem |
❌ |
|
|
|
10 |
Dynamic Programming |
Gold Mine Problem |
❌ |
|
|
|
11 |
Dynamic Programming |
Assembly Line SchedulingProblem |
❌ |
|
|
|
12 |
Dynamic Programming |
Painting the Fenceproblem |
❌ |
|
|
|
13 |
Dynamic Programming |
Maximize The Cut Segments |
❌ |
|
|
|
14 |
Dynamic Programming |
Longest Common Subsequence |
❌ |
|
|
|
15 |
Dynamic Programming |
Longest Repeated Subsequence |
❌ |
|
|
|
16 |
Dynamic Programming |
Longest Increasing Subsequence |
❌ |
|
|
|
17 |
Dynamic Programming |
Space Optimized Solution of LCS |
❌ |
|
|
|
18 |
Dynamic Programming |
LCS (Longest Common Subsequence) of three strings |
❌ |
|
|
|
19 |
Dynamic Programming |
Maximum Sum Increasing Subsequence |
❌ |
|
|
|
20 |
Dynamic Programming |
Count all subsequences having product less than K |
❌ |
|
|
|
21 |
Dynamic Programming |
Longest subsequence such that difference between adjacent is one |
❌ |
|
|
|
22 |
Dynamic Programming |
Maximum subsequence sum such that no three are consecutive |
❌ |
|
|
|
23 |
Dynamic Programming |
Egg Dropping Problem |
❌ |
|
|
|
24 |
Dynamic Programming |
Maximum Length Chain of Pairs |
❌ |
|
|
|
25 |
Dynamic Programming |
Maximum size square sub-matrix with all 1s |
❌ |
|
|
|
26 |
Dynamic Programming |
Maximum sum of pairs with specific difference |
❌ |
|
|
|
27 |
Dynamic Programming |
Min Cost PathProblem |
❌ |
|
|
|
28 |
Dynamic Programming |
Maximum difference of zeros and ones in binary string |
❌ |
|
|
|
29 |
Dynamic Programming |
Minimum number of jumps to reach end |
❌ |
|
|
|
30 |
Dynamic Programming |
Minimum cost to fill given weight in a bag |
❌ |
|
|
|
31 |
Dynamic Programming |
Minimum removals from array to make max –min <= K |
❌ |
|
|
|
32 |
Dynamic Programming |
Longest Common Substring |
❌ |
|
|
|
33 |
Dynamic Programming |
Count number of ways to reacha given score in a game |
❌ |
|
|
|
34 |
Dynamic Programming |
Count Balanced Binary Trees of Height h |
❌ |
|
|
|
35 |
Dynamic Programming |
LargestSum Contiguous Subarray [V>V>V>V IMP ] |
❌ |
|
|
|
36 |
Dynamic Programming |
Smallest sum contiguous subarray |
❌ |
|
|
|
37 |
Dynamic Programming |
Unbounded Knapsack (Repetition of items allowed) |
❌ |
|
|
|
38 |
Dynamic Programming |
Word Break Problem |
❌ |
|
|
|
39 |
Dynamic Programming |
Largest Independent Set Problem |
❌ |
|
|
|
40 |
Dynamic Programming |
Partition problem |
❌ |
|
|
|
41 |
Dynamic Programming |
Longest Palindromic Subsequence |
❌ |
|
|
|
42 |
Dynamic Programming |
Count All Palindromic Subsequence in a given String |
❌ |
|
|
|
43 |
Dynamic Programming |
Longest Palindromic Substring |
❌ |
|
|
|
44 |
Dynamic Programming |
Longest alternating subsequence |
❌ |
|
|
|
45 |
Dynamic Programming |
Weighted Job Scheduling |
❌ |
|
|
|
46 |
Dynamic Programming |
Coin game winner where every player has three choices |
❌ |
|
|
|
47 |
Dynamic Programming |
Count Derangements (Permutation such that no element appears in its original position) [ IMPORTANT ] |
❌ |
|
|
|
48 |
Dynamic Programming |
Maximum profit by buying and selling a share at most twice [ IMP ] |
❌ |
|
|
|
49 |
Dynamic Programming |
Optimal Strategy for a Game |
❌ |
|
|
|
50 |
Dynamic Programming |
Optimal Binary Search Tree |
❌ |
|
|
|
51 |
Dynamic Programming |
Palindrome PartitioningProblem |
❌ |
|
|
|
52 |
Dynamic Programming |
Word Wrap Problem |
❌ |
|
|
|
53 |
Dynamic Programming |
Mobile Numeric Keypad Problem [ IMP ] |
❌ |
|
|
|
54 |
Dynamic Programming |
Boolean Parenthesization Problem |
❌ |
|
|
|
55 |
Dynamic Programming |
Largest rectangular sub-matrix whose sum is 0 |
❌ |
|
|
|
56 |
Dynamic Programming |
Largest area rectangular sub-matrix with equal number of 1’s and 0’s [ IMP ] |
❌ |
|
|
|
57 |
Dynamic Programming |
Maximum sum rectangle in a 2D matrix |
❌ |
|
|
|
58 |
Dynamic Programming |
Maximum profit by buying and selling a share at most k times |
❌ |
|
|
|
59 |
Dynamic Programming |
Find if a string is interleaved of two other strings |
❌ |
|
|
|
60 |
Dynamic Programming |
Maximum Length of Pair Chain |
❌ |
|
|
|