DoorDash Dynamic Programming Questions

9 dynamic programming problems asked at DoorDash interviews

Medium (5)Hard (4)

Questions

Title	Difficulty	Acceptance	Frequency
Binary Tree Maximum Path Sum	Hard	42.0%	87.5%
Longest Increasing Path in a Matrix	Hard	56.3%	87.5%
Maximum Profit in Job Scheduling	Hard	54.6%	75.0%
Longest Common Subsequence	Medium	58.9%	50.0%
Count All Valid Pickup and Delivery Options	Hard	64.9%	50.0%
01 Matrix	Medium	53.3%	50.0%
Jump Game	Medium	40.5%	37.5%
Jump Game II	Medium	42.4%	25.0%
Longest Palindromic Substring	Medium	37.3%	25.0%

Showing 9 questions