Dynamic Programming Interview Questions
503 real interview questions test Dynamic Programming. Practice any of them in the code editor and get AI feedback on your solution.
- Junior2% (12)
- Mid/Senior49% (246)
- Staff49% (245)
Companies that ask Dynamic Programming the most
Questionspage 5 of 6
- Minimize the Difference Between Target and Chosen Elements1 companyMid/Senior
- Number of Unique Good Subsequences1 companyStaff
- First Day Where You Have Been in All the Rooms1 companyMid/Senior
- Vowels of All Substrings1 companyMid/Senior
- Count Fertile Pyramids in a Land1 companyStaff
- Minimum Time to Remove All Cars Containing Illegal Goods1 companyStaff
- Maximum AND Sum of Array1 companyStaff
- Minimum Time to Finish the Race1 companyStaff
- Minimum White Tiles After Covering With Carpets1 companyStaff
- Maximum Value of K Coins From Piles1 companyStaff
- Check if There Is a Valid Parentheses String Path1 companyStaff
- Substring With Largest Variance1 companyStaff
- Steps to Make Array Non-decreasing1 companyMid/Senior
- Selling Pieces of Wood1 companyStaff
- Number of Distinct Roll Sequences1 companyStaff
- Maximum Score Of Spliced Array1 companyStaff
- Check if There is a Valid Partition For The Array1 companyMid/Senior
- Number of Ways to Reach a Position After Exactly k Steps1 companyMid/Senior
- Longest Increasing Subsequence II1 companyStaff
- Find All Good Indices1 companyMid/Senior
- Maximum Deletions on a String1 companyStaff
- Number of Beautiful Partitions1 companyStaff
- Minimum Cost to Split an Array1 companyStaff
- Disconnect Path in a Binary Matrix by at Most One Flip1 companyMid/Senior
- Find the String with LCP1 companyStaff
- Number of Ways to Earn Points1 companyStaff
- Make Costs of Paths Equal in a Binary Tree1 companyMid/Senior
- Minimum Cost to Make All Characters Equal1 companyMid/Senior
- Ways to Split Array Into Good Subarrays1 companyMid/Senior
- Minimum Time to Make Array Sum At Most x1 companyStaff
- Check if it is Possible to Split Array1 companyMid/Senior
- Sorting Three Groups1 companyMid/Senior
- Number of Beautiful Integers in the Range1 companyStaff
- Maximize the Profit as the Salesman1 companyMid/Senior
- Maximize Value of Function in a Ball Passing Game1 companyStaff
- Minimum Edge Weight Equilibrium Queries in a Tree1 companyStaff
- Count Valid Paths in a Tree1 companyStaff
- Count Visited Nodes in a Directed Graph1 companyStaff
- Apply Operations to Make Two Strings Equal1 companyMid/Senior
- Longest Unequal Adjacent Groups Subsequence I1 companyJunior
- Minimum Increment Operations to Make Array Beautiful1 companyMid/Senior
- Maximum Points After Collecting Coins From All Nodes1 companyStaff
- Maximum Score After Applying Operations on a Tree1 companyMid/Senior
- Maximum Balanced Subsequence Sum1 companyStaff
- Number of Strings Which Can Be Rearranged to Contain Substring1 companyMid/Senior
- Remove Adjacent Almost-Equal Characters1 companyMid/Senior
- Find Number of Coins to Place in Tree Nodes1 companyStaff
- Maximize Consecutive Elements in an Array After Modification1 companyStaff
- Find the Sum of Subsequence Powers1 companyStaff
- Minimum Sum of Values by Dividing Array1 companyStaff
- Minimum Number of Operations to Satisfy Conditions1 companyMid/Senior
- Maximum Difference Score in a Grid1 companyMid/Senior
- Find the Minimum Cost Array Permutation1 companyStaff
- Find Number of Ways to Reach the K-th Stair1 companyStaff
- Find the Maximum Length of a Good Subsequence I1 companyMid/Senior
- Find the Maximum Length of a Good Subsequence II1 companyStaff
- Maximum Total Reward Using Operations I1 companyMid/Senior
- Maximum Total Reward Using Operations II1 companyStaff
- Minimum Operations to Make Binary Array Elements Equal to One II1 companyMid/Senior
- Maximize Total Cost of Alternating Subarrays1 companyMid/Senior
- Construct String with Minimum Cost1 companyStaff
- Find the Count of Monotonic Pairs II1 companyStaff
- Maximum Energy Boost From Two Drinks1 companyMid/Senior
- Maximum XOR Score Subarray Queries1 companyStaff
- Find the Maximum Sequence Value of Array1 companyStaff
- Minimum Number of Valid Strings to Form Target I1 companyMid/Senior
- Find Maximum Removals From Source String1 companyMid/Senior
- Find the Number of Possible Ways for an Event1 companyStaff
- Count The Number of Winning Sequences1 companyStaff
- Maximum Points Tourist Can Earn1 companyMid/Senior
- Sum of Good Subsequences1 companyStaff
- Count K-Reducible Numbers Less Than N1 companyStaff
- Maximize Sum of Weights after Edge Removals1 companyStaff
- Minimum Time to Break Locks I1 companyMid/Senior
- Count Paths With the Given XOR Value1 companyMid/Senior
- Count Substrings Divisible By Last Digit1 companyStaff
- Select K Disjoint Special Substrings1 companyMid/Senior
- Longest Palindromic Subsequence After at Most K Operations1 companyMid/Senior
- Zero Array Transformation IV1 companyMid/Senior
- Count Beautiful Numbers1 companyStaff
- Longest Palindrome After Substring Concatenation II1 companyStaff
- Find X Value of Array I1 companyMid/Senior
- Concatenated Divisibility1 companyStaff
- Path Existence Queries in a Graph II1 companyStaff
- Merge Operations for Minimum Travel Time1 companyStaff
- Find Maximum Number of Non Intersecting Substrings1 companyMid/Senior
- Maximum Good Subtree Score1 companyStaff
- Find Weighted Median Node in Tree1 companyStaff
- Partition Array to Minimize XOR1 companyMid/Senior
- Maximum Number of Subsequences After One Inserting1 companyMid/Senior
- Maximum Balanced Shipments1 companyMid/Senior
- Subsequence Sum After Capping Elements1 companyMid/Senior
- Number of Stable Subsequences1 companyStaff
- Longest Non-Decreasing Subarray After Replacing at Most One Element1 companyMid/Senior
- Count Distinct Integers After Removing Zeros1 companyMid/Senior
- Total Waviness of Numbers in Range I1 companyMid/Senior
- Maximum Subgraph Score in a Tree1 companyStaff
- Count Routes to Climb a Rectangular Grid1 companyStaff
- Minimum Cost to Split into Ones1 companyMid/Senior
- Minimum XOR Path in a Grid1 companyMid/Senior