Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 3004. Maximum Subtree of the Same Color
Given a rooted tree where each node has a color, find the size of the largest subtree (a node plus all its descendants) in which every node has the same color. The core challenge is to traverse the tree and aggregate whether each subtree is uniform and its size (typically via post-order DFS/DP) to compute the maximum.
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.