dsa7 min read
Number of Ways to Arrive at Destination — Dijkstra With Path Counts [LC 1976, Google, Amazon]
Master LeetCode 1976 Number of Ways to Arrive at Destination: extend Dijkstra to count the number of distinct shortest paths simultaneously, returning the count modulo 10^9+7. A FAANG-favourite shortest-path counting interview question asked at Google, Amazon, and Meta.
Read →