Leetcode 3123. Find Edges in Shortest Paths
Given an undirected weighted graph, determine for each edge whether it lies on at least one shortest path from node 0 to node n-1. This requires computing shortest distances (e.g., from source and target) and checking for each edge if using it attains the global shortest distance.
Asked at:
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Early September, 2024
Mid-level
Count unique edges in shortest paths for two people reaching a destination in an undirected graph
Hello Interview Premium
Your account is free and you can post anonymously if you choose.