# Minimum Fuel Cost To Report To The Capital: Explained
Minimum Fuel Cost To Report To The Capital shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
DFS from capital 0: each subtree of size s needs ceil(s / seats) liters to send everyone toward the parent (except the capital itself).
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (graph BFS, Dijkstra, Union-Find, or interval DP) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(n).
## Common mistake
Charging one liter per node instead of packing seats, which overcounts badly.
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at www.linkjob.ai.