Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 1976. Number of Ways to Arrive at Destination
Count how many distinct routes achieve the minimum travel time from node 0 to node n-1 in a connected undirected weighted graph. The standard approach uses Dijkstra with a priority queue to maintain shortest distances and a parallel count array (mod 1e9+7) that accumulates ways when equal shortest distances are found.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.