PRACTICE

DP Interview Questions

10 DP problems asked across FAANG and top tech companies. Approach hints, optimal solutions, and related problems.

🔒

to save your progress.

0ProblemDifficultyCompaniesBreakdown / SolutionLeetCode
Best Time to Buy and Sell Stock IIMedium3 companiesView breakdown →
Wildcard MatchingHard2 companiesView breakdown →
Minimum Edge Reversals So Every Node Is ReachableHard3 companiesView breakdown →
Minimum Operations to Reduce an Integer to 0Medium3 companiesView breakdown →
Split Array Largest SumHard3 companiesView breakdown →
Binary Tree Maximum Path SumHard3 companiesView breakdown →
Partition Array Into Two Arrays to Minimize Sum DifferenceHard1 companiesView breakdown →
Longest Palindromic SubsequenceMedium1 companiesView breakdown →
Longest Increasing SubsequenceMedium1 companiesView breakdown →
Last Stone Weight IIMedium1 companiesView breakdown →

Practice with a Mock Interview

Solve these DP problems under real interview pressure with our AI interviewer.

Start Mock Interview →