DoorDash Dynamic Programming Questions

9 dynamic programming problems asked at DoorDash interviews

Medium (5)Hard (4)

Questions

Title	Difficulty	Acceptance	Frequency
Longest Increasing Path in a Matrix	Hard	56.3%	92.5%
Binary Tree Maximum Path Sum	Hard	42.0%	91.4%
Maximum Profit in Job Scheduling	Hard	54.6%	78.1%
Count All Valid Pickup and Delivery Options	Hard	64.9%	57.8%
01 Matrix	Medium	53.4%	50.7%
Longest Common Subsequence	Medium	58.9%	45.7%
Jump Game	Medium	40.5%	33.6%
Jump Game II	Medium	42.5%	26.7%
Longest Palindromic Substring	Medium	37.4%	26.7%

Showing 9 questions