Nutanix Dynamic Programming Questions

13 dynamic programming problems asked at Nutanix interviews

Medium (5)Hard (8)

Questions

Title	Difficulty	Acceptance	Frequency
Delivering Boxes from Storage to Ports	Hard	40.1%	100.0%
Binary Tree Maximum Path Sum	Hard	42.0%	66.9%
Longest Increasing Path in a Matrix	Hard	56.3%	66.9%
Best Sightseeing Pair	Medium	62.7%	66.9%
Binary Tree Cameras	Hard	47.6%	55.8%
Longest Palindromic Subsequence	Medium	65.1%	55.8%
Trapping Rain Water	Hard	66.8%	55.8%
Minimum Cost to Make All Characters Equal	Medium	54.2%	55.8%
Jump Game II	Medium	42.5%	55.8%
Maximum Employees to Be Invited to a Meeting	Hard	61.8%	55.8%
Palindrome Partitioning II	Hard	36.6%	55.8%
Split Array Largest Sum	Hard	59.9%	55.8%
Word Break	Medium	49.1%	55.8%

Showing 13 questions