Leetcode 2093. Minimum Cost to Reach City With Discounts

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.