Top 50 Dynamic Programming Coding Problems for Interviews
Last Updated :
22 Feb, 2025
Improve
Here is the collection of the Top 50 list of frequently asked interview questions on Dynamic Programming. Problems in this Article are divided into three Levels so that readers can practice according to the difficulty level step by step.
Easy Problems
- Nth Catalan Number
- Minimum Operations
- Minimum steps to delete using palindrome substrings
- Minimum number of Coins
- Maximum Product Cutting
- Ways to Cover a Distance
- Minimum number of deletions and insertions to transform
- Minimum sum subsequence such that one of every four consecutive is picked
Medium Problems
- Subset Sum Problem
- Longest Common Subsequence
- Longest Increasing Subsequence
- Edit Distance
- Longest Path In Matrix
- Optimal Strategy for a Game
- 0-1 Knapsack Problem
- Shortest Common Supersequence
- Partition problem
- Rod Cutting
- Coin change problem
- Word Break Problem
- Dice Throw Problem
- Box Stacking
- Egg Dropping Puzzle
- Max length chain
- Longest Common Substring
- Interleaved strings
- Maximum sum increasing subsequence
- Minimum number of jumps
- Count subsequences of type a^i, b^j, c^k
- Get Minimum Squares
- Nth Fibonacci Number
- Longest Palindromic Substring
- Total Decoding Messages
- Unique BST’s
- Player with max score
- Form a palindrome
- Word Wrap Problem
- Count Palindromic Subsequences
- Minimum time to finish tasks without skipping two consecutive
Hard Problems
- Minimum Partition
- Boolean Parenthesization Problem
- Matrix Chain Multiplication
- Longest Zig-Zag Sub Sequence
- Maximum Profit
- Maximum Path Sum in Matrix
- The painter’s partition problem
- Palindrome Partitioning
- Array Partition
- Maximum difference of zeros and ones in binary string
- Count digit groupings of a number
Related Articles
- Top 50 Array Coding Problems for Interviews
- Top 50 String Coding Problems for Interviews
- Top 50 Tree Coding Problems for Interviews
- Top 50 Graph Coding Problems for Interviews
- Top 50 Sorting Coding Problems for Interviews
- Top 50 Searching Coding Problems for Interviews
- Top 50 Binary Search Tree Coding Problems for Interviews
