NVIDIA Dynamic Programming Questions

19 dynamic programming problems asked at NVIDIA interviews

Easy (4)Medium (13)Hard (2)

Questions

Title	Difficulty	Acceptance	Frequency
Best Time to Buy and Sell Stock	Easy	56.4%	82.1%
Minimum Operations to Reduce an Integer to 0	Medium	61.1%	77.1%
Maximum Subarray	Medium	53.0%	75.1%
Trapping Rain Water	Hard	66.8%	67.9%
Fibonacci Number	Easy	73.9%	57.3%
Unique Paths II	Medium	44.2%	57.3%
House Robber	Medium	52.9%	52.3%
Jump Game	Medium	40.5%	52.3%
Generate Parentheses	Medium	78.3%	45.8%
Climbing Stairs	Easy	53.9%	45.8%
Maximal Square	Medium	50.0%	45.8%
Counting Bits	Easy	80.4%	45.8%
Minimum Path Sum	Medium	67.8%	45.8%
Longest Increasing Subsequence	Medium	59.1%	45.8%
Sliding Puzzle	Hard	74.2%	36.9%
All Possible Full Binary Trees	Medium	82.7%	36.9%
Unique Paths	Medium	66.6%	36.9%
Longest Palindromic Substring	Medium	37.4%	36.9%
Maximum Product Subarray	Medium	36.0%	36.9%

Showing 19 questions