Home » Interview coding problems/challenges

# Top 25 Dynamic programming problems for interviews

This section contains the link to the **solution of the top 25 dynamic programming problems for interviews**.

Submitted by Radib Kar, on June 19, 2020

Dynamic programming is one of the most asked paradigms in any product-based company interviews. You can expect DP in online assessments also if you are in touch with any product-based company. For beginner its, of course, a Tough nut to crack. But if we can learn the pattern, we can solve dynamic problems easily. At IncludeHelp, we have tried to list out popular dynamic programing problems asked most frequently in company interviews and have listed them according to their patterns. If you learn one pattern you can solve all problems in the category.

## List to the dynamic programming problems

These are the most important dynamic programming problems asked in various technical interviews,

- (0-1) knapsack problem
- House robber
- Coin change
- Optimal strategy in a game
- Word break Problem
- Longest Increasing Subsequence
- Equal sum partitions
- Egg Dropping puzzle
- Knapsack with duplicate items
- Minimum path sum
- Unique number of ways to reach
- Longest common subsequence
- Edit distance
- Egg dropping puzzle
- Subset sum
- Minimum number of jumps
- Rod Cutting
- Adjacent are not allowed
- Number of binary strings without consecutive 1's
- Total number of non-decreasing number
- Highway billboard
- Minimum cost to make two strings similar
- Total number of palindromic subsequences
- Minimum number of deletions to make it sorted sequence
- Find out Longest palindromic subsequence

These are frequently asked dynamic programing questions as of now. We will keep updating the section as per the latest interview problems. Feel free to comment if you find any other problem to be listed here.

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.