Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
- Find and Count Maximum-Score Grid Paths
Coding · Dynamic Programming · Grids & Matrices
- Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree
Coding
- Find Shortest Distance Between Multiple Sources and Destinations in Matrix
Coding
- Find Shortest Path with K Hops
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Google
Leetcode 3123. Find Edges in Shortest Paths
Reported Sep 6, 2024 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View source