Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 1339. Maximum Product of Splitted Binary Tree
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.)
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.