Software Engineer signal: topological sort + cycle detection in a location graph context. This is a ProdMatch-owned software engineer drill, framed as a April 2026 Uber Maps Infra simulation, not a copied platform question.
Company context
Uber · Maps Infra
Freshness
April 2026
Product surface
location graph
ProdMatch interview simulation based on product-team patterns; not a claim of a real company question.
You own location graph for a Software Engineer loop. Given nodes and directed dependencies between them, return a valid execution order. If a cycle exists, return an empty list and identify that the rollout is blocked.
Input
Output
Constraints
Concepts
nodes: 4, deps: [[0,1],[0,2],[2,3]] -> [0,1,2,3] or [0,2,1,3]
Try framing your own approach first. The 30 seconds you think before peeking is where learning happens.
Reveal the approach first.
Your rating tunes when this problem shows up again.