A tree has N nodes labeled from 1 to N. The weight of a node is weight[i]. The discrepancy of node x and i is : discrepancy(x, i) = distance(x, i) * weight[i].
Return the minimum total discrepancy of the tree...
Return the minimum total discrepancy of the tree...
Get one-to-one training from Google Facebook engineers
Top-notch Professionals
Learn from Facebook and Google senior engineers interviewed 100+ candidates.
Most recent interview questions and system design topics gathered from aonecode alumnus.
One-to-one online classes. Get feedbacks from real interviewers.
Customized Private Class
Already a coding expert? - Advance straight to hard interview topics of your interest.
New to the ground? - Develop basic coding skills with your own designated mentor.
Days before interview? - Focus on most important problems in target company question bank.