Morgan Stanley Dynamic Programming Questions

16 dynamic programming problems asked at Morgan Stanley interviews

Easy (1)Medium (14)Hard (1)

Questions

Title	Difficulty	Acceptance	Frequency
Best Time to Buy and Sell Stock	Easy	56.4%	100.0%
Best Team With No Conflicts	Medium	50.6%	96.1%
Minimum Number of Lines to Cover Points	Medium	43.9%	91.6%
Delete and Earn	Medium	57.1%	78.8%
Jump Game	Medium	40.5%	61.5%
Generate Parentheses	Medium	78.3%	51.4%
Coin Change II	Medium	60.4%	51.4%
Minimum Number of Taps to Open to Water a Garden	Hard	51.0%	51.4%
Longest Common Subsequence	Medium	58.9%	51.4%
Minimum Substring Partition of Equal Character Frequency	Medium	40.0%	51.4%
Sum of Subarray Minimums	Medium	38.3%	51.4%
Longest Palindromic Substring	Medium	37.4%	51.4%
Maximum Subarray	Medium	53.0%	51.4%
Maximum Product Subarray	Medium	36.0%	51.4%
Longest Increasing Subsequence	Medium	59.1%	51.4%
Coin Change	Medium	48.0%	51.4%

Showing 16 questions