Amazon Delivery Route Max Path Sum
Amazon Delivery Route Max Path Sum
MediumTrees50% accepted
Amazon delivery route planner models routes as a binary tree where node values represent profit margins (can be negative). Find the maximum path sum where the path can start and end at any node and does not need to pass through the root.
Approach
Find the maximum path sum in a binary tree (path between any two nodes).
Input
3
1 2 3
Output
6
More Trees problems
Browse all coding problems →solution.py
Loading editor...
Test 1
Test 2
Test 3
Press Run to test your custom input, or Submit to judge against all test cases.
Sign in to continue
Create a free account to run code, submit solutions and track progress.
- Free forever — no credit card
- 10+ languages with live execution
- Points, streaks & leaderboards