# Top Dynamic Programming Questions

Last Updated: 25 Mar, 2023

Filters

Topics

+ 19 more

Company

+ 313 more

Difficulty

Dynamic programming interview questions are among the most prevalent ones that give engineers uneasiness. For coding interviews, Dynamic programming is one of the favourite topics of many top tech companies. The perfect place to increase your thinking abilities and practice Dynamic programming questions is right here. Learn the concept and remove the fear of DP with codestudio.

Problem Title

EXP

Difficulty

Avg Time to solve

Attempted

Wildcard Pattern Matching

138

120

Hard

50 mins

15.5k

Longest Common Subsequence

97

80

Moderate

39 mins

68.7k

Colorful Knapsack

47

120

Hard

45 mins

1.4k

Edit Distance

72

80

Moderate

30 mins

16k

Maximum Subarray Sum

20

80

Moderate

25 mins

1.1k

Minimum Cost To Buy Oranges

11

80

Moderate

20 mins

0.7k

Longest Increasing Subsequence

81

80

Moderate

30 mins

28k

House Robber

48

80

Moderate

26 mins

5.2k

Tiling Problem

36

120

Hard

45 mins

3.9k

Minimum Cost Path

26

80

Moderate

25 mins

1.3k

Trapping Rain Water

58

80

Moderate

15 mins

7.3k

Ways To Make Coin Change

66

80

Moderate

20 mins

26.9k

Maximum Subarray Sum

708

80

Moderate

35 mins

74.7k

Simplify the Directory

13

80

Moderate

22 mins

0.6k

Common Digit Longest Subsequence

18

80

Moderate

31 mins

0.8k

Best Time to Buy and Sell

16

80

Moderate

20 mins

0.6k

Word Break-1

57

80

Moderate

36 mins

0.7k

Break Number

9

80

Moderate

35 mins

0.3k

Maximum Coins

23

120

Hard

16 mins

0.3k

Valid String

39

80

Moderate

18 mins

1.2k

Distinct Subsequences

40

80

Moderate

10 mins

1.7k

Rod cutting problem

123

80

Moderate

40 mins

27.2k

Dice Throws

9

120

Hard

35 mins

0.6k

Palindrome Partitioning

34

80

Moderate

25 mins

3.3k

Partition to K equal sum subsets

22

80

Moderate

40 mins

1.7k

Wildcard Pattern Matching

Hard

120

138 upvotes

Longest Common Subsequence

Moderate

80

97 upvotes

Colorful Knapsack

Hard

120

47 upvotes

Edit Distance

Moderate

80

72 upvotes

Maximum Subarray Sum

Moderate

80

20 upvotes

Minimum Cost To Buy Oranges

Moderate

80

11 upvotes

Longest Increasing Subsequence

Moderate

80

81 upvotes

House Robber

Moderate

80

48 upvotes

Tiling Problem

Hard

120

36 upvotes

Minimum Cost Path

Moderate

80

26 upvotes

Trapping Rain Water

Moderate

80

58 upvotes

Ways To Make Coin Change

Moderate

80

66 upvotes

Maximum Subarray Sum

Moderate

80

708 upvotes

Simplify the Directory

Moderate

80

13 upvotes

Common Digit Longest Subsequence

Moderate

80

18 upvotes

Best Time to Buy and Sell

Moderate

80

16 upvotes

Word Break-1

Moderate

80

57 upvotes

Break Number

Moderate

80

9 upvotes

Maximum Coins

Hard

120

23 upvotes

Valid String

Moderate

80

39 upvotes

Distinct Subsequences

Moderate

80

40 upvotes

Rod cutting problem

Moderate

80

123 upvotes

Dice Throws

Hard

120

9 upvotes

Palindrome Partitioning

Moderate

80

34 upvotes

Partition to K equal sum subsets

Moderate

80

22 upvotes