Available question text
Find the minimum travel cost from a source city to a destination in a weighted graph when you may apply a limited number of discounts that reduce the cost of traversed edges. This is solved by running a shortest-path algorithm (e.g., Dijkstra) on an expanded state space that tracks how many discounts have been used.
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
No company association
Leetcode 2093. Minimum Cost to Reach City With Discounts
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source