Experienced (3+ years)

Dynamic Programming Interview Questions for Experienced Professionals

For developers with a few years of Dynamic Programming under their belt, these 46 questions go beyond the basics into the architecture, performance and decision-making that experienced interviews focus on.

46Questions13Intermediate33Senior

46 Dynamic Programming questions

  1. 1Climbing Stairs (Variation of Fibonacci)Intermediate
  2. 2Palindromic Substrings / SubsequencesIntermediate
  3. 3Subset Sum ProblemIntermediate
  4. 4Word Break ProblemIntermediate
  5. 5Matrix Chain MultiplicationIntermediate
  6. 6Coin Change Problem (Total Ways)Intermediate
  7. 7Edit Distance (Levenshtein)Intermediate
  8. 8Longest Increasing Subsequence (LIS)Intermediate
  9. 9Longest Common Subsequence (LCS)Intermediate
  10. 10The 0/1 Knapsack ProblemIntermediate
  11. 11Dynamic Programming Interview Question 2 (Free)Intermediate
  12. 12Dynamic Programming Interview Question 5 (Free)Intermediate
  13. 13Dynamic Programming Interview Question 3 (Free)Senior
  14. 14Iterative DP with Circular Dependencies (Value Iteration)Senior
  15. 15DP for Sequence Alignment in Large DatasetsSenior
  16. 16Longest Path in a Directed Acyclic Graph (DAG)Senior
  17. 17Graph DP: Bellman-Ford as a DP algorithmSenior
  18. 18Matrix Exponentiation for Linear RecurrencesSenior
  19. 19Lagrangian Relaxation and DPSenior
  20. 20Adaptive DP for Real-time Decision MakingSenior
  21. 21Memory-Local DP (Cache-Oblivious Row-by-Row)Senior
  22. 22Min-Cost Max-Flow via DP (Successive Shortest Path)Senior
  23. 23Resource Allocation DP in Distributed SystemsSenior
  24. 24DP in Bioinformatics: Smith-Waterman AlgorithmSenior
  25. 25SOS DP (Sum Over Subsets)Senior
  26. 26Tree Rerooting DP TechniqueSenior
  27. 27Alien's Trick (WQS Binary Search on DP)Senior
  28. 28Wildcard and Regular Expression Matching LogicSenior
  29. 29DP for Optimal Binary Search Tree (OBST)Senior
  30. 30Recursive DP with Tail Call OptimizationSenior
  31. 31Persistent DP Tables for Versioned SolversSenior
  32. 32The 'Broken Profile' DP techniqueSenior
  33. 33DP with Fenwick Tree / Segment Tree optimizationSenior
  34. 34Profile DP (Tiling Problems)Senior
  35. 35Non-Linear DP (Polygon Triangulation)Senior
  36. 36Divide and Conquer DP OptimizationSenior
  37. 37Knuth's Optimization in DPSenior
  38. 38Convex Hull Trick for DP OptimizationSenior
  39. 39Probability DP (Expected Value Problems)Senior
  40. 40Bitmask DP for TSP and Set CoverSenior
  41. 41Digit DP for Range ProblemsSenior
  42. 42DP on Trees (Diameter and Max Path Sum)Senior
  43. 43Space Optimization in DP (State Compression)Senior
  44. 44Dynamic Programming Advanced Interview Question 9Senior
  45. 45Dynamic Programming Advanced Interview Question 8Intermediate
  46. 46Dynamic Programming Advanced Interview Question 6Senior

Explore more Dynamic Programming interview questions

By Level

By Experience

By Year

Or browse all Dynamic Programming interview questions.

Frequently asked questions

Which Dynamic Programming questions do experienced (3+ years) get asked?

This page collects 46 Dynamic Programming interview questions aligned with experienced (3+ years), ranging across the difficulty levels that match that experience band.

How do I prepare for a Dynamic Programming interview with my experience level?

Work through these questions in order, make sure you can explain each answer out loud, and pay attention to the real-world examples and follow-ups — interviewers at this level care as much about reasoning as the final answer.

Do the answers include code and examples?

Yes — answers include explanations, code examples where relevant, common mistakes to avoid and follow-up questions so you are ready for the full interview conversation.