•PRACTICE

Dynamic Programming Interview Questions

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

Filter by company

Clear all ✕
Adobe (5)Amazon (10)Apple (12)Atlassian (8)Databricks (4)Google (12)Meta (11)Microsoft (10)Netflix (2)OpenAI (1)Oracle (7)Rippling (1)Salesforce (11)Uber (8)Walmart (12)

Filter by topic

Array (178)Backtracking (17)BFS (23)Binary Search (34)Binary Tree (13)Bit Manipulation (16)Breadth-First Search (20)Counting (7)Data Stream (6)Database (6)Depth-First Search (27)Design (37)DFS (24)Divide and Conquer (7)Doubly-Linked List (5)DP (10)Dynamic Programming (39)Graph (6)Graph Theory (13)Greedy (31)Hash Table (87)Heap (12)Heap (Priority Queue) (13)Linked List (15)Math (32)Matrix (22)Monotonic Stack (6)Ordered Set (8)Prefix Sum (11)Queue (10)Recursion (7)Simulation (11)Sliding Window (21)Sorting (45)Stack (24)String (85)Topological Sort (6)Tree (30)Trie (10)Two Pointers (30)Union-Find (13)
🔒

to save your progress.

✓ 0ProblemDifficultyCompaniesBreakdown / SolutionLeetCode
Best Time to Buy and Sell StockEasy10 companiesView breakdown →
Longest Palindromic SubstringMedium9 companiesView breakdown →
Trapping Rain WaterHard7 companiesView breakdown →
House RobberMedium5 companiesView breakdown →
Climbing StairsEasy7 companiesView breakdown →
Maximum SubarrayMedium9 companiesView breakdown →
Coin ChangeMedium7 companiesView breakdown →
Word BreakMedium9 companiesView breakdown →
Decode WaysMedium7 companiesView breakdown →
Maximum Product SubarrayMedium7 companiesView breakdown →
Jump Game IIMedium4 companiesView breakdown →
Generate ParenthesesMedium4 companiesView breakdown →
Longest Common SubsequenceMedium2 companiesView breakdown →
Minimum Difficulty of a Job ScheduleHard2 companiesView breakdown →
Beautiful ArrangementMedium1 companiesView breakdown →
Count Different Palindromic SubsequencesHard1 companiesView breakdown →
Delete and EarnMedium1 companiesView breakdown →
Distinct SubsequencesHard1 companiesView breakdown →
Edit DistanceMedium1 companiesView breakdown →
Fibonacci NumberEasy1 companiesView breakdown →
Jump GameMEDIUM1 companiesView breakdown →
House Robber IIIMEDIUM1 companiesView breakdown →
Longest Valid ParenthesesHARD1 companiesView breakdown →
House Robber IIMEDIUM1 companiesView breakdown →
Longest String ChainMEDIUM1 companiesView breakdown →
Longest Mountain in ArrayMEDIUM1 companiesView breakdown →
Minimum Cost For TicketsMEDIUM1 companiesView breakdown →
Palindrome PartitioningMEDIUM1 companiesView breakdown →
Minimum Cost to Reach Destination in TimeHARD1 companiesView breakdown →
Minimum Number of Refueling StopsHARD1 companiesView breakdown →
Maximize Sum of Weights after Edge RemovalsHARD1 companiesView breakdown →
Number of Ways to Form a Target String Given a DictionaryHARD1 companiesView breakdown →
Optimal Account BalancingHARD1 companiesView breakdown →
Painting a Grid With Three Different ColorsHARD1 companiesView breakdown →
Valid Parenthesis StringMedium1 companiesView breakdown →
Time Needed to Rearrange a Binary StringMEDIUM1 companiesView breakdown →
Russian Doll EnvelopesHARD1 companiesView breakdown →
Strange PrinterHard1 companiesView breakdown →
Word Break IIHard1 companiesView breakdown →

Practice with a Mock Interview

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

Start Mock Interview →