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