Problem · Tree
Maximum Sum Path Between Two Leaf Nodes
● Hard
GoogleINTERNOA
See Google hiring insightsGoogleINTERNOAProblem statement
Given the root of a binary tree whose nodes contain integer values, return the maximum sum of the node values along a simple path whose two endpoints are distinct leaves.
The problem statement continues
ProExamples
Example 1
root = [1,2,3]return = 6The only leaf-to-leaf path is 2 - 1 - 3, whose node values sum to 6.
Original screenshot from the interview report
ProFastPrep Pro
Reported in 1 Google 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
- 2 more worked examples, explained
- Guided hints and editorial
- Run your code on real test cases
$9/month
Pro subscription, billed yearly — or $19 month-to-month. Cancel anytime.
Free plan — 2 of 2 free unlocks used this week