Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 1973. Count Nodes Equal to Sum of Descendants
Given a binary tree, count how many nodes have a value equal to the sum of all values in their descendant nodes (i.e., the subtree sum excluding the node itself). This typically requires computing subtree sums (postorder DFS) and comparing each node’s value to its descendants’ total.
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.