LeetCode
Question
·
Mar 2024
·
Los Angeles
How to find the maximum path in a binary tree between 2 leaf nodes? | DoorDash Interview
2 upvotes
456 views
4 replies
Question Details
Struggling to figure out the code for maximum path sum in binary tree problem variation where the maximum sum is calculated only between 2 leaf nodes.
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