30% off Lifetime Premium Access expires December 2nd!

30% off Lifetime Premium Access expires Dec 2nd!

Your Dashboard

Interview Coaching

Mock Interviews

1:1 Mentorship

Salary Negotiation

Practice

Learn

System Design

ML System Design

Code

Behavioral

Salary Negotiation

Interview Guides

Blog

Community

Interview Questions

Interview Experiences

Peer System Design Library

Ask The Community

Discord

Refer a Friend

Pricing

Become a Coach

⌘K

Pricing Become a Coach

⌘K

Get Premium

Leetcode 124. Binary Tree Maximum Path Sum

Find the maximum sum of any non-empty connected path in a binary tree (nodes used at most once), where the path can start and end at any nodes and node values may be negative. You must account for single-node paths when all values are negative.

Asked at:

Doordash

Datadog

Amazon

Salesforce

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Mid November, 2025

Salesforce

Mid-level

Late July, 2025

Doordash

Mid-level

Late July, 2025

Doordash

Mid-level

Get Premium to View All 8 Reports

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 124. Binary Tree Maximum Path Sum

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact