Meta Dynamic Programming Questions

29 dynamic programming problems asked at Meta interviews

Easy (4)Medium (16)Hard (9)

Questions

Title	Difficulty	Acceptance	Frequency
Best Time to Buy and Sell Stock	Easy	56.4%	76.4%
Trapping Rain Water	Hard	66.8%	60.6%
Longest Palindromic Substring	Medium	37.4%	59.0%
Climbing Stairs	Easy	53.9%	52.8%
Maximum Subarray	Medium	53.0%	52.1%
Generate Parentheses	Medium	78.3%	47.5%
Palindromic Substrings	Medium	72.6%	47.0%
Regular Expression Matching	Hard	30.5%	46.2%
Unique Paths	Medium	66.6%	42.2%
Jump Game	Medium	40.5%	41.6%
Word Break	Medium	49.1%	40.7%
Binary Tree Maximum Path Sum	Hard	42.0%	40.7%
Valid Palindrome III	Hard	49.1%	40.7%
Best Time to Buy and Sell Stock II	Medium	70.8%	39.8%
Decode Ways	Medium	37.6%	39.8%
Maximal Rectangle	Hard	58.1%	37.0%
Word Break II	Hard	55.1%	36.3%
Wildcard Matching	Hard	31.4%	35.4%
Unique Paths II	Medium	44.2%	34.5%
Jump Game II	Medium	42.5%	33.6%
Best Time to Buy and Sell Stock III	Hard	53.2%	32.0%
Edit Distance	Medium	60.2%	31.6%
Pascal's Triangle	Easy	78.7%	27.9%
Longest Valid Parentheses	Hard	38.1%	26.9%
House Robber	Medium	52.9%	24.1%
Palindrome Partitioning	Medium	73.7%	24.1%
Minimum Path Sum	Medium	67.8%	22.3%
Unique Binary Search Trees II	Medium	62.0%	16.1%
Pascal's Triangle II	Easy	67.1%	14.1%

Showing 29 questions