Top 50 Dynamic Programming Coding Problems for Interviews

Dynamic Programming in Data Structures and Algorithms is used for breaking down the main problems into smaller problems. This article also breaks down all the problems into different sections which will help you to solve the problems section-wise. It includes the most common and trending problems of dynamic programming for clearing the interviews.

Here are the problems list from beginner to expert level for learning the DP ?

Beginner DP Problems

• Climbing Stairs
• House Robber
• Maximum Subarray
• Coin Change
• Best Time to Buy and Sell Stock
• Pascal's Triangle
• Range Sum Query
• Fibonacci Number
• Min Cost Climbing Stairs
• Maximum Profit in Job Scheduling

Intermediate DP Problems

• Longest Increasing Subsequence
• Longest Common Subsequence
• Edit Distance
• Unique Binary Search Trees
• Decode Ways
• Longest Palindromic Substring
• Maximum Profit in Stock Buying and Selling
• Partition Equal Subset Sum
• Target Sum
• Coin Change 2

Advanced DP Problems

• Minimum Window Subsequence
• Burst Balloons
• Longest Palindromic Subsequence
• Maximum Rectangle in Histogram
• Word Break
• Regular Expression Matching
• Wildcard Matching
• Palindrome Partitioning
• Maximum Sum of 3 Non-Overlapping Subarrays
• Paint House Series

Expert DP Problems

• Optimal Binary Search Tree
• Matrix Chain Multiplication
• Longest Valid Parentheses
• Russian Doll Envelopes
• Minimum Cost to Merge Stones
• Super Egg Drop
• Largest Rectangle in Histogram
• Maximum Profit in Job Scheduling
• Maximum games played by winner