Question Details
LeetCode #124: Binary Tree Maximum Path Sum. Difficulty: Hard. Topics: Dynamic Programming, Tree, Depth-First Search, Binary Tree. Asked at DoorDash in the last 6 months.
Original Source
This is a frequency-tagged signal. The full problem statement lives on the original source.
View original →Topics
Binary Tree
Depth-First Search
Tree
Binary Tree
Dynamic Programming
Graph
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