Skip to content

Practice Minimum Increments to Equalize Leaf Paths

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#3593
LeetCode Problem

Minimum Increments to Equalize Leaf Paths

Problem Statement

You are given an integer n and an undirected tree rooted at node 0 with n nodes numbered from 0 to n - 1. This is represented by a 2D array edges of length n - 1, where edges[i] = [ui, vi] indicates an edge from node ui to vi . Each node i has an associated cost given by cost[i], representing the cost to traverse that node. The score of a path is defined as the sum of the costs of all nodes along the path. Your goal is to make the scores of all root-to-leaf paths equal by increasing the cost of any number of nodes by any non-negative amount. Return the minimum number of nodes whose cost must be increased to make all root-to-leaf path scores equal.

Source: Minimum Increments to Equalize Leaf Paths on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
n = 3, edges = [[0,1],[0,2]], cost = [2,1,3]
Output
1

# Example 2

Input
n = 3, edges = [[0,1],[1,2]], cost = [5,1,4]
Output
0

# Example 3

Input
n = 5, edges = [[0,4],[0,1],[1,2],[1,3]], cost = [3,4,1,1,7]
Output
1

Constraints

2 <= n <= 10^5
edges.length == n - 1
edges[i] == [ui, vi]
0 <= ui, vi < n
cost.length == n
1 <= cost[i] <= 10^9
The input is generated such that edges represents a valid tree.

Related LeetCode Problems

Practice more problems similar to Minimum Increments to Equalize Leaf Paths.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.