Sponsored
Use these hints if you're stuck. Try solving on your own first.
Run a DFS on the tree and update an array sum where sum[i] is the sum for level i.
The answer is the first minimum element of sum.
Solve with full IDE support and test cases
