Microsoft Dynamic Programming Questions

30 dynamic programming problems asked at Microsoft interviews

Easy (3)Medium (18)Hard (9)

Questions

Title	Difficulty	Acceptance	Frequency
Longest Palindromic Substring	Medium	37.4%	75.8%
Trapping Rain Water	Hard	66.8%	75.7%
Maximum Subarray	Medium	53.0%	72.9%
Climbing Stairs	Easy	53.9%	68.0%
Generate Parentheses	Medium	78.3%	60.2%
Minimum Edge Reversals So Every Node Is Reachable	Hard	57.3%	59.7%
Best Time to Buy and Sell Stock	Easy	56.4%	59.7%
Jump Game	Medium	40.5%	59.4%
Minimum Path Sum	Medium	67.8%	58.1%
Jump Game II	Medium	42.5%	54.0%
Unique Paths	Medium	66.6%	52.8%
Regular Expression Matching	Hard	30.5%	51.6%
Split Array Largest Sum	Hard	59.9%	50.3%
Minimum Operations to Reduce an Integer to 0	Medium	61.1%	50.3%
Edit Distance	Medium	60.2%	49.5%
Longest Valid Parentheses	Hard	38.1%	47.2%
Decode Ways	Medium	37.6%	45.5%
Maximal Rectangle	Hard	58.1%	44.5%
House Robber	Medium	52.9%	41.2%
Word Break	Medium	49.1%	41.2%
Wildcard Matching	Hard	31.4%	39.0%
Interleaving String	Medium	43.5%	36.2%
Best Time to Buy and Sell Stock III	Hard	53.2%	36.0%
Partition Equal Subset Sum	Medium	49.2%	32.8%
Is Subsequence	Easy	48.9%	32.8%
Binary Tree Maximum Path Sum	Hard	42.0%	30.3%
Unique Paths II	Medium	44.2%	24.1%
Best Time to Buy and Sell Stock II	Medium	70.8%	22.6%
Unique Binary Search Trees	Medium	63.3%	21.0%
Unique Binary Search Trees II	Medium	62.0%	13.2%

Showing 30 questions