Media.net Dynamic Programming Questions

12 dynamic programming problems asked at Media.net interviews

Easy (1)Medium (4)Hard (7)

Questions

Title	Difficulty	Acceptance	Frequency
Minimum Total Space Wasted With K Resizing Operations	Medium	43.9%	100.0%
Difference Between Maximum and Minimum Price Sum	Hard	33.3%	100.0%
Count the Number of Square-Free Subsets	Medium	26.4%	100.0%
Make the XOR of All Segments Equal to Zero	Hard	41.0%	87.5%
Minimum XOR Sum of Two Arrays	Hard	50.6%	87.5%
Russian Doll Envelopes	Hard	37.7%	87.5%
Jump Game IX	Medium	23.8%	87.5%
Trapping Rain Water	Hard	66.8%	75.0%
Find Maximum Non-decreasing Array Length	Hard	18.5%	62.5%
Minimum Number of Valid Strings to Form Target I	Medium	21.7%	62.5%
Climbing Stairs	Easy	53.9%	62.5%
The Number of Good Subsets	Hard	37.1%	50.0%

Showing 12 questions