PRACTICE

Dynamic Programming Interview Questions

65 Dynamic Programming problems asked across FAANG and top tech companies. Approach hints, optimal solutions, and related problems.

Ready to try these in a real interview?

I'm Alex. I'll interview you on 2 problems like these at your level, ask follow-ups, and give you a scored report.

Start mock with Alex
🔒

to save your progress.

Companies

Topics

Dynamic Programming 65
Dynamic ProgrammingClear all
121.Best Time to Buy and Sell Stock
ArrayDynamic Programming
Easy+10▶ Mock
5.Longest Palindromic Substring
StringDynamic Programming
Medium+8▶ Mock
42.Trapping Rain Water
ArrayTwo PointersStack
Hard+6▶ Mock
198.House Robber
Dynamic ProgrammingArray
Medium+1▶ Mock
70.Climbing Stairs
Dynamic ProgrammingMath
Easy+4▶ Mock
53.Maximum Subarray
ArrayDynamic ProgrammingDivide and Conquer
Medium+7▶ Mock
322.Coin Change
Dynamic ProgrammingBreadth-First Search
Medium+4▶ Mock
139.Word Break
Dynamic ProgrammingHash TableTrie
Medium+5▶ Mock
91.Decode Ways
Dynamic ProgrammingString
Medium+4▶ Mock
152.Maximum Product Subarray
ArrayDynamic Programming
Medium+4▶ Mock
45.Jump Game II
ArrayDynamic ProgrammingGreedy
Medium▶ Mock
22.Generate Parentheses
StringDynamic ProgrammingBacktracking
Medium+1▶ Mock
122.Best Time to Buy and Sell Stock II
ArrayDynamic ProgrammingGreedy
Medium▶ Mock
44.Wildcard Matching
StringDynamic ProgrammingGreedy
Hard▶ Mock
2858.Minimum Edge Reversals So Every Node Is Reachable
Dynamic ProgrammingDepth-First SearchBreadth-First Search
Hard▶ Mock
2571.Minimum Operations to Reduce an Integer to 0
Dynamic ProgrammingGreedyBit Manipulation
Medium▶ Mock
410.Split Array Largest Sum
ArrayBinary SearchDynamic Programming
Hard▶ Mock
124.Binary Tree Maximum Path Sum
Dynamic ProgrammingTreeDepth-First Search
Hard▶ Mock
2035.Partition Array Into Two Arrays to Minimize Sum Difference
ArrayBinary SearchDynamic Programming
Hard▶ Mock
516.Longest Palindromic Subsequence
StringDynamic Programming
Medium▶ Mock
300.Longest Increasing Subsequence
ArrayBinary SearchDynamic Programming
Medium▶ Mock
1049.Last Stone Weight II
ArrayDynamic ProgrammingKnapsack
Medium▶ Mock
1143.Longest Common Subsequence
StringDynamic Programming
Medium▶ Mock
1335.Minimum Difficulty of a Job Schedule
ArrayDynamic Programming
Hard▶ Mock
526.Beautiful Arrangement
ArrayDynamic ProgrammingBacktracking
Medium▶ Mock
2484.Count Different Palindromic Subsequences
StringDynamic Programming
Hard▶ Mock
740.Delete and Earn
ArrayHash TableDynamic Programming
Medium▶ Mock
115.Distinct Subsequences
StringDynamic Programming
Hard▶ Mock
72.Edit Distance
StringDynamic Programming
Medium▶ Mock
509.Fibonacci Number
MathDynamic ProgrammingRecursion
Easy▶ Mock
55.Jump Game
ArrayDynamic ProgrammingGreedy
Medium▶ Mock
337.House Robber III
Dynamic ProgrammingTreeDepth-First Search
Medium▶ Mock
32.Longest Valid Parentheses
StringDynamic ProgrammingStack
Hard▶ Mock
213.House Robber II
ArrayDynamic Programming
Medium▶ Mock
1048.Longest String Chain
ArrayHash TableTwo Pointers
Medium▶ Mock
845.Longest Mountain in Array
ArrayTwo PointersDynamic Programming
Medium▶ Mock
983.Minimum Cost For Tickets
ArrayDynamic Programming
Medium▶ Mock
131.Palindrome Partitioning
StringDynamic ProgrammingBacktracking
Medium▶ Mock
1928.Minimum Cost to Reach Destination in Time
ArrayDynamic ProgrammingGraph
Hard▶ Mock
871.Minimum Number of Refueling Stops
ArrayDynamic ProgrammingGreedy
Hard▶ Mock
3367.Maximize Sum of Weights after Edge Removals
Dynamic ProgrammingTreeDepth-First Search
Hard▶ Mock
1639.Number of Ways to Form a Target String Given a Dictionary
ArrayStringDynamic Programming
Hard▶ Mock
465.Optimal Account Balancing
ArrayDynamic ProgrammingBacktracking
Hard▶ Mock
1931.Painting a Grid With Three Different Colors
Dynamic ProgrammingGraph Coloring
Hard▶ Mock
678.Valid Parenthesis String
StringDynamic ProgrammingStack
Medium▶ Mock
2380.Time Needed to Rearrange a Binary String
StringDynamic ProgrammingSimulation
Medium▶ Mock
354.Russian Doll Envelopes
ArrayBinary SearchDynamic Programming
Hard▶ Mock
664.Strange Printer
StringDynamic Programming
Hard▶ Mock
140.Word Break II
ArrayHash TableString
Hard▶ Mock
64.Minimum Path Sum
ArrayDynamic ProgrammingMatrix
Medium▶ Mock
118.Pascal's Triangle
ArrayDynamic Programming
Easy▶ Mock
494.Target Sum
ArrayDynamic ProgrammingBacktracking
Medium▶ Mock
773.Sliding Puzzle
ArrayDynamic ProgrammingBacktracking
Hard▶ Mock
787.Cheapest Flights Within K Stops
Dynamic ProgrammingDepth-First SearchBreadth-First Search
Medium▶ Mock
790.Domino and Tromino Tiling
Dynamic Programming
Medium▶ Mock
838.Push Dominoes
Two PointersStringDynamic Programming
Medium▶ Mock
968.Binary Tree Cameras
Dynamic ProgrammingTreeDepth-First Search
Hard▶ Mock
1043.Partition Array for Maximum Sum
ArrayDynamic Programming
Medium▶ Mock
1125.Smallest Sufficient Team
ArrayDynamic ProgrammingBit Manipulation
Hard▶ Mock
1235.Maximum Profit in Job Scheduling
ArrayBinary SearchDynamic Programming
Hard▶ Mock
1434.Number of Ways to Wear Different Hats to Each Other
ArrayDynamic ProgrammingBit Manipulation
Hard▶ Mock
1751.Maximum Number of Events That Can Be Attended II
ArrayBinary SearchDynamic Programming
Hard▶ Mock
2050.Parallel Courses III
ArrayDynamic ProgrammingGraph
Hard▶ Mock
2439.Minimize Maximum of Array
ArrayBinary SearchDynamic Programming
Medium▶ Mock
2466.Count Ways To Build Good Strings
Dynamic Programming
Medium▶ Mock

Practice with a Mock Interview

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

Start Mock Interview →