Problem intelligence
Find Edges in Shortest Paths
HARD · 2 companies · Breadth-First Search · Depth-First Search · Graph Theory · Heap (Priority Queue) · Shortest Path
Interview priority
50
medium
Target overlap
0/0
Recency
30
Trend
50
Frequency
100
Company observations
DoorDasholder27.8
DoorDashall27.3
WeRideall100
Why this score
high frequency100
unsolved100
Local progress
unseen