Home » Interview coding problems

# Dynamic programming practice problems with solutions

Dynamic programming practice problems: Here, you will find the various dynamic programming practice problems with solutions that are commonly asked in the various interview rounds of the companies. Each dynamic programming practice problem has its solution with the examples, detailed explanations of the solution approaches.

## List of the dynamic programming practice problems

- 0-1 Knapsack Algorithm
- House Robber
- Coin Change
- Minimum Coin Change | Find minimum number of coins that make a given value
- Word Break Problem
- Friends pairing problem
- Maximum Profit in Stock Buy and sell with at most K Transaction
- Floyd Warshall Algorithm
- Optimal Strategy for a Game
- Highway billboard
- Gold Mine Problem
- Longest Increasing Subsequence
- Minimum Number of coins to make the change
- Get Minimum Squares
- Count Numbers with unique digits
- Maximum Sum Problem
- Find number of times a string occurs as a subsequence
- Number of Unique Paths
- Minimum number of jumps
- Rod Cutting
- Dice throw
- Longest Common Subsequence
- Longest Repeating Subsequence
- Length of the Longest Bitonic Subsequence
- Print the Longest Bitonic Subsequence
- Find out the longest palindromic subsequence from a string
- Find out the length of the longest palindromic subsequence from a string
- Count the number of palindromic subsequences in a given string
- Subset Sum
- Equal Sum partition
- Maximize the cut segments
- Pizza Mania Problem
- Letter/Blog Writer Coding Problem (using Dynamic Programming)
- Largest zigzag sequence
- Number of ways to construct the grid
- Minimum number of deletions to make a string palindrome
- Minimum Cost to Make Two Strings Identical
- Shortest Common Super Sequence
- Printing Longest Common Subsequence
- Wine selling problem | Find the maximum profit from sale of wines
- Egg Dropping Problem
- Probability of getting more number of heads than tails if coins are tossed
- Minimum Path Sum
- Maximum path sum in a binary tree
- Minimum number of deletions to make a sorted sequence
- Jumbled Strings
- Count of divisible array
- Maximum Calorie
- Special Keyboard
- Minimal moves to form a string
- Total number of non-decreasing numbers with n digits using dynamic programming
- Minimum Time to Display N Character
- Sum of all substrings of a number
- Count of Subarrays
- Knapsack with Duplicate Items
- Longest Common Subsequence of three strings
- Minimum steps to minimize n as per given condition
- Count total number of Palindromic Subsequences
- Minimum cost to fill given weight in a bag
- Adjacent are not allowed
- Count number of binary strings without consecutive 1's
- Longest Palindromic Substring
- Count total number of Palindromic Substrings
- Find the maximum sum alternating subsequence
- High-effort vs. Low-effort Task Problem
- Largest Independent Set Problem
- Longest alternating subsequence
- Print the longest alternating subsequence
- Step count problem | Find the number of possible combinations to reach the final step
- Print Maximum Length Chain of Pairs
- Longest Increasing Odd Even Subsequence
- Island Probability
- Activity Selection Problem
- Weighted Job Scheduling
- K-Palindromic String
- Find Total Ways to Reach Nth Stair from Bottom
- Mobile Keypad Problem
- Box Stacking Problem
- Maximization of Quadruple
- Path in Matrix
- Maximum Product Cutting
- Maximum Sum Increasing Subsequence
- Largest Square Sub Matrix of 1's in Given Binary Matrix
- Count Total Possible Path with Given Sum

TOP Interview Coding Problems/Challenges

- Run-length encoding (find/print frequency of letters in a string)
- Sort an array of 0's, 1's and 2's in linear time complexity
- Checking Anagrams (check whether two string is anagrams or not)
- Relative sorting algorithm
- Finding subarray with given sum
- Find the level in a binary tree with given sum K
- Check whether a Binary Tree is BST (Binary Search Tree) or not
- 1[0]1 Pattern Count
- Capitalize first and last letter of each word in a line
- Print vertical sum of a binary tree
- Print Boundary Sum of a Binary Tree
- Reverse a single linked list
- Greedy Strategy to solve major algorithm problems
- Job sequencing problem
- Root to leaf Path Sum
- Exit Point in a Matrix
- Find length of loop in a linked list
- Toppers of Class
- Print All Nodes that don't have Sibling
- Transform to Sum Tree
- Shortest Source to Destination Path

Comments and Discussions

**Ad:**
Are you a blogger? Join our Blogging forum.