Leetcode 2440. Create Components With Same Value

Given a tree with positive node values, delete edges to split it into connected components so that every component has the same sum, and return the maximum number of edges you can remove. Core challenge: choose a target component sum (must divide the total sum) and verify via subtree-sum checks/DFS whether the tree can be partitioned into that many equal-sum components to maximize cuts.