Available question text
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)).
Related questions
Continue with questions that share topics or the same question type.
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
Amazon
Leetcode 2477. Minimum Fuel Cost to Report to the Capital
Reported Apr 23, 2025 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View source