Software Engineer signal: shortest path + weighted graph in a location graph context. This is a ProdMatch-owned software engineer drill, framed as a May 2026 Delhivery Maps Infra simulation, not a copied platform question.
Company context
Delhivery · Maps Infra
Freshness
May 2026
Product surface
location graph
ProdMatch interview simulation based on product-team patterns; not a claim of a real company question.
In location graph, entities are connected by weighted evidence edges. For each query, find the least-cost evidence path from source to target while avoiding blocked entities.
Input
Output
Constraints
Concepts
0-1 cost 2, 1-2 cost 3, query 0->2 -> 5
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.