Samsung Dynamic Programming Questions

15 dynamic programming problems asked at Samsung interviews

Easy (1)Medium (8)Hard (6)

Questions

Title	Difficulty	Acceptance	Frequency
Burst Balloons	Hard	63.0%	98.0%
Longest Increasing Subsequence	Medium	59.1%	95.9%
Partition Array Into Two Arrays to Minimize Sum Difference	Hard	23.0%	93.7%
Number of Paths with Max Score	Hard	42.1%	93.7%
Largest 1-Bordered Square	Medium	52.0%	91.1%
Maximum Height by Stacking Cuboids	Hard	61.7%	91.1%
Trapping Rain Water	Hard	66.8%	88.4%
Best Time to Buy and Sell Stock	Easy	56.4%	67.1%
Generate Parentheses	Medium	78.3%	59.6%
Maximum Subarray	Medium	53.0%	49.1%
Coin Change	Medium	48.0%	49.1%
Split Array Largest Sum	Hard	59.9%	49.1%
Jump Game II	Medium	42.5%	49.1%
Longest Palindromic Substring	Medium	37.4%	49.1%
Edit Distance	Medium	60.2%	49.1%

Showing 15 questions