LinkedIn Dynamic Programming Questions

21 dynamic programming problems asked at LinkedIn interviews

Easy (1)Medium (15)Hard (5)

Questions

Title	Difficulty	Acceptance	Frequency
Maximum Subarray	Medium	53.0%	77.4%
Maximum Product Subarray	Medium	36.0%	73.0%
Partition to K Equal Sum Subsets	Medium	38.4%	68.7%
Paint House	Medium	64.3%	67.9%
Longest Valid Parentheses	Hard	38.1%	59.2%
House Robber	Medium	52.9%	57.6%
Longest Palindromic Subsequence	Medium	65.1%	56.3%
Can I Win	Medium	31.0%	56.3%
Palindromic Substrings	Medium	72.6%	53.4%
Maximize Total Tastiness of Purchased Fruits	Medium	64.6%	50.0%
Maximum Number of Non-overlapping Palindrome Substrings	Hard	43.3%	50.0%
Paint House II	Hard	56.9%	49.0%
Edit Distance	Medium	60.2%	45.8%
Valid Parenthesis String	Medium	39.8%	39.7%
Longest Palindromic Substring	Medium	37.4%	37.1%
Largest Color Value in a Directed Graph	Hard	57.3%	32.0%
01 Matrix	Medium	53.4%	32.0%
Maximum Profit in Job Scheduling	Hard	54.6%	29.6%
House Robber IV	Medium	64.8%	27.8%
House Robber II	Medium	44.6%	27.8%
Best Time to Buy and Sell Stock	Easy	56.4%	20.8%

Showing 21 questions