9 views
# Minimum Cost of a Path With Special Roads II (LeetCode 2686) ## Approach Dijkstra over special endpoints. ## Edge cases Empty / n=1 / large k. ## Practice tip Restate constraints aloud. Interview prep: [try it free](https://www.linkjob.ai/).