Zeta Dynamic Programming Questions

13 dynamic programming problems asked at Zeta interviews

Medium (7)Hard (6)

Questions

Title	Difficulty	Acceptance	Frequency
Apply Operations to Make Two Strings Equal	Medium	27.6%	100.0%
Split Array Largest Sum	Hard	59.9%	82.7%
Trapping Rain Water	Hard	66.8%	70.0%
Palindrome Partitioning II	Hard	36.6%	70.0%
Remove Boxes	Hard	49.3%	70.0%
Maximal Rectangle	Hard	58.1%	59.9%
Maximum Subarray	Medium	53.0%	59.9%
Minimize the Maximum Difference of Pairs	Medium	50.9%	59.9%
Binary Tree Cameras	Hard	47.6%	59.9%
Partition to K Equal Sum Subsets	Medium	38.4%	59.9%
Guess Number Higher or Lower II	Medium	52.5%	59.9%
Word Break	Medium	49.1%	59.9%
House Robber	Medium	52.9%	59.9%

Showing 13 questions