Available question text
Find an edge whose removal splits the tree into two subtrees such that the product of their sums is maximized, and return that maximum product modulo 10^9+7. (Consider subtree sums for every possible split; n ≤ 5×10^4, node values ≤ 10^4.)
Related questions
Continue with questions that share topics or the same question type.
- Binary Tree Maximum Path Sum
Coding · Binary Tree · Depth-First Search · DP on Trees
- Find the Maximum Ancestor Value Across All Leaf Nodes in a Binary Tree
Coding
- Maximum Binary Tree
Coding
- Maximum Binary Tree II
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1339. Maximum Product of Splitted Binary Tree
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source