ProdMatch
CompaniesCitiesRolesSign in

Companies

  • Google
  • Microsoft
  • Meta
  • Amazon
  • Apple
  • Atlassian
  • Nvidia
  • Oracle
  • See all 51 →

Cities

  • Bengaluru jobs
  • Hyderabad jobs
  • Pune jobs
  • Gurugram jobs
  • Noida jobs
  • Delhi NCR jobs
  • Mumbai jobs
  • Chennai jobs
  • Remote-India jobs

Roles

  • QA / SDET Engineers
  • Backend Engineers
  • Frontend Engineers
  • Full-stack Engineers
  • Data Analysts
  • Data Engineers
  • ML / AI Engineers
  • DevOps / SRE Engineers
  • All roles →

ProdMatch

  • About
  • Career guides
  • Compare
  • Salaries
  • Skills
  • DSA practice
  • Privacy
  • Terms
  • Sign in

© 2026 ProdMatch.ai · Built for India · DPDP Act 2023 compliant · Job data sourced from official company career pages.

Back to DSA
Graphsmedium45 minSoftware Engineer

Search Evidence Path Finder

Software Engineer signal: shortest path + weighted graph in a product search context. This is a ProdMatch-owned software engineer drill, framed as a May 2026 Uber Search Quality simulation, not a copied platform question.

Company context

Uber · Search Quality

Freshness

May 2026

Product surface

product search

ProdMatch interview simulation based on product-team patterns; not a claim of a real company question.

Question

In product search, 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

  • Weighted graph, blocked set, and q source-target queries.

Output

  • Minimum cost per query, or -1 if unreachable.

Constraints

  • 1 <= nodes <= 100000
  • 1 <= edges <= 300000
  • 1 <= queries <= 100000
  • All weights are non-negative.

Concepts

  • invariants
  • API correctness
  • graph modelling
  • shortest path
  • weighted graph
  • retrieval quality

0-1 cost 2, 1-2 cost 3, query 0->2 -> 5

Approach

Try framing your own approach first. The 30 seconds you think before peeking is where learning happens.

Clean Solution

Reveal the approach first.

How well did you understand?

Your rating tunes when this problem shows up again.

Common Mistakes

  • Mark visited when enqueueing, not after repeated dequeue.
  • Do not ignore disconnected components if the product surface can have them.

Next Similar Problems

Workflow Dependency DAG RecoverymediumWorkflow Evidence Path FinderhardSearch Dependency DAG Recoveryhard