Shortest path with at most one curved edge
Filed under Uber
The question
Given a graph where each pair of connected vertices has two edges between them (one straight with weight w1 and one curved with weight w2), find the shortest path from vertex a to vertex b using at most one curved edge in the entire path.
No write-up yet. Related questions below have one.
Related Uber questions
Collected from public candidate posts and coding forums. Updated Nov 2026.