Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
- Add Consecutive-Value Bonuses to Grid Paths
Coding
- Alert Using Same Key-Card Three or More Times in a One Hour Period
Coding
- Average Value of Even Numbers That Are Divisible by Three
Coding
- Build a File-Backed Key-Value Store
Coding · File & Media Storage · Key-Value Stores
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2440. Create Components With Same Value
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source