Top 40 Dynamic Programming Questions

Company:

Facebook
Amazon
Microsoft
Apple
Uber
LinkedIn
Airbnb
Adobe
Goldman Sachs And Many More...

Easy:

  1. Climbing Stairs: (https://leetcode.com/problems/climbing-stairs/)
  2. Best Time to Buy and Sell Stock: (https://leetcode.com/problems/best-time-to-buy-and-sell-stock/)
  3. House Robber: (https://leetcode.com/problems/house-robber/)
  4. Maximum Subarray: (https://leetcode.com/problems/maximum-subarray/)
  5. Fibonacci Number: (https://leetcode.com/problems/fibonacci-number/)
  6. Minimum Path Sum: (https://leetcode.com/problems/minimum-path-sum/)
  7. Palindrome Partitioning II : (https://leetcode.com/problems/palindrome-partitioning-ii/)
  8. Unique Binary Search Trees: (https://leetcode.com/problems/unique-binary-search-trees/)
  9. Word Break: (https://leetcode.com/problems/word-break/)
  10. Counting Bits: (https://leetcode.com/problems/counting-bits/)

Medium:

  1. Coin Change](https://leetcode.com/problems/coin-change/)
  2. Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/)
  3. Unique Paths](https://leetcode.com/problems/unique-paths/)
  4. Decode Ways](https://leetcode.com/problems/decode-ways/)
  5. Longest Palindromic Subsequence](https://leetcode.com/problems/longest-palindromic-subsequence/)
  6. Combination Sum IV](https://leetcode.com/problems/combination-sum-iv/)
  7. Longest Increasing Path in a Matrix](https://leetcode.com/problems/longest-increasing-path-in-a-matrix/)
  8. Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/)
  9. Paint House](https://leetcode.com/problems/paint-house/)
  10. Target Sum](https://leetcode.com/problems/target-sum/)

Hard:

  1. Edit Distance: (https://leetcode.com/problems/edit-distance/)
  2. Wildcard Matching: (https://leetcode.com/problems/wildcard-matching/)
  3. Regular Expression Matching: (https://leetcode.com/problems/regular-expression-matching/)
  4. Distinct Subsequences: (https://leetcode.com/problems/distinct-subsequences/)
  5. Maximum Length of Pair Chain: (https://leetcode.com/problems/maximum-length-of-pair-chain/)
  6. Jump Game II : (https://leetcode.com/problems/jump-game-ii/)
  7. Minimum Window Subsequence: (https://leetcode.com/problems/minimum-window-subsequence/)
  8. Minimum Cost to Merge Stones: (https://leetcode.com/problems/minimum-cost-to-merge-stones/)
  9. Palindrome Partitioning III : (https://leetcode.com/problems/palindrome-partitioning-iii/)
  10. Cherry Pickup II : (https://leetcode.com/problems/cherry-pickup-ii/)

Advanced:

  1. Count Different Palindromic Subsequences: (https://leetcode.com/problems/count-different-palindromic-subsequences/)
  2. Maximum Vacation Days: (https://leetcode.com/problems/maximum-vacation-days/)
  3. Strange Printer: (https://leetcode.com/problems/strange-printer/)
  4. Maximal Square: (https://leetcode.com/problems/maximal-square/)
  5. Largest Divisible Subset: (https://leetcode.com/problems/largest-divisible-subset/)
  6. Burst Balloons: (https://leetcode.com/problems/burst-balloons/)
  7. Count Palindromic Subsequences: (https://leetcode.com/problems/count-palindromic-subsequences/)
  8. Minimum Number of Refueling Stops: (https://leetcode.com/problems/minimum-number-of-refueling-stops/)
  9. Maximum Profit in Job Scheduling: (https://leetcode.com/problems/maximum-profit-in-job-scheduling/)
  10. Longest Chunked Palindrome Decomposition: (https://leetcode.com/problems/longest-chunked-palindrome-decomposition/)
Comments (3)