Maximum Sum Among Longest Root-to-Leaf Paths
Amazonâ—Ź MediumINTERNONSITE INTERVIEWProblem statement
Given a nonempty binary tree, consider every path that starts at the root and ends at a leaf. The length of a path is its number of nodes, and its sum is the sum of those node values.
The problem statement continues
ProExamples
Example 1
root = [1,2,3,4,null,5,6]return = 10The longest paths contain three nodes. Their sums are 1 + 2 + 4 = 7, 1 + 3 + 5 = 9, and 1 + 3 + 6 = 10, so return 10.
FastPrep Pro
Reported in 1 Amazon interview this weekUnlock this recently reported problem
FastPrep Pro gives you full access to interview problems reported within the last week.
- Full problem statement and constraints
- 1 more worked example, explained
- Guided hints and editorial
- Run your code on real test cases
$8.25/month
$99 billed yearly — or $19 month-to-month. Cancel anytime.
Free plan — 2 of 2 free unlocks used this week