LeetCode
Experience
·
Oct 2021
·
USA
DoorDash | Coding | Max Tree Path Sum
16 upvotes
5,234 views
16 replies
Interview Experience
From an onsite Given a binary tree, find the maximum path sum from any two "alive nodes" within the tree. We can assume a node is an alive node if and...
Full Details
🔒
Unlock full leaked content
Full insider details, leaked discussions, and candidate experiences.
Get Premium →Topics
Binary Tree
More from DoorDash
Reddit
DoorDash Gets Rid Of LeetCode Interviews In Favor Of AI Technical Interview
Reddit
DoorDash Analytics Engineer Technical Interview
Reddit
Doordash phone screen yay or nay ?
1p3a
DoorDash Senior Engineer Interview: Code Craft and System Design
1p3a
Doordash Software Engineer Onsite Interview Experience and Insights