Leetcode 2477. Minimum Fuel Cost to Report to the Capital
Given a tree rooted at city 0 with one representative per node and cars of fixed capacity, compute the minimum fuel (edge traversals) needed to get everyone to the capital; the core challenge is aggregating subtree representative counts and summing the required trips across each edge (ceil(subtree_size / seats)).
Asked at:
Amazon
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
Late April, 2025
Amazon
Mid-level
There is a tree (i.e., a connected, undirected graph with no cycles) structure country network consisting of n cities numbered from 0 to n - 1 and exactly n - 1 roads. The capital city is city 0. You are given a 2D integer array roads where roads[i] = [ai, bi] denotes that there exists a bidirectional road connecting cities ai and bi. There is a meeting for the representatives of each city. The meeting is in the capital city. There is a car in each city. You are given an integer seats that indicates the number of seats in each car. A representative can use the car in their city to travel or change the car and ride with another representative. The cost of traveling between two cities is one liter of fuel. Return the minimum number of liters of fuel to reach the capital city.
Hello Interview Premium
Your account is free and you can post anonymously if you choose.