Question was a variant of max binary tree path sum: https://leetcode.com/problems/binary-tree-maximum-path-sum/description/ The difference was the paths could only start and end at leaves. If you search the forum you will see...

LeetCode Experience · Feb 2024

Doordash Phone Screen (Reject)

SWE Phone Screen

3 upvotes 626 views 1 reply

Interview Experience

Question was a variant of max binary tree path sum: The difference was the paths could only start and end at leaves. If you search the forum you will see...

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

← All DoorDash questions DoorDash Software Engineer Questions → All Binary Tree Questions →