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.

Asked at:

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Early December, 2025

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 508. Most Frequent Subtree Sum

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact