Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 508. Most Frequent Subtree Sum
Compute every node's subtree sum (sum of values in its subtree) and return the sum(s) that occur most frequently. The core challenge is performing a postorder traversal to aggregate sums, count their frequencies, and handle ties by returning all maxima.
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.