MathWorks Dynamic Programming Questions

10 dynamic programming problems asked at MathWorks interviews

Medium (4)Hard (6)

Questions

Title	Difficulty	Acceptance	Frequency
Binary Tree Cameras	Hard	47.6%	88.9%
Shopping Offers	Medium	52.3%	88.9%
Minimum Cost Tree From Leaf Values	Medium	67.8%	88.9%
String Transformation	Hard	26.7%	80.5%
Minimum Edge Reversals So Every Node Is Reachable	Hard	57.3%	72.6%
Longest String Chain	Medium	62.8%	60.7%
Sum of Distances in Tree	Hard	65.5%	60.7%
Split Array Largest Sum	Hard	59.9%	60.7%
Distinct Subsequences	Hard	51.5%	51.2%
Beautiful Arrangement	Medium	64.7%	51.2%

Showing 10 questions