Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 979. Distribute Coins in Binary Tree
Given a binary tree where total coins equals the number of nodes, compute the minimum number of parent-child moves needed so every node has exactly one coin; this is solved by a bottom-up traversal that computes subtree surplus/deficit and sums the absolute transfers across edges.
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.