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.