Quick Overview

Find the minimum fuel-purchase cost for traveling through a weighted city network with different local prices and unlimited carrying capacity. The algorithmic discussion examines path state beyond location, exact wide-integer costs, dominance, unreachable destinations, and why ordinary shortest-path modeling is insufficient.

Minimize Fuel Cost Across Cities

Company: Microsoft

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: medium

Interview Round: Onsite

Overview: Find the minimum fuel-purchase cost for traveling through a weighted city network with different local prices and unlimited carrying capacity. The algorithmic discussion examines path state beyond location, exact wide-integer costs, dominance, unreachable destinations, and why ordinary shortest-path modeling is insufficient.

Loading…