Find minimum-latency path across dependent services

Q: How do I practice coding and algorithm questions?

Use PracHub's coding console to write, test, and debug your solutions in Python or JavaScript. View hints, test against sample inputs, and compare with official solutions.

Q: What difficulty level is this coding question?

This is a hard difficulty Coding & Algorithms question, commonly asked during Technical Screen rounds at Snapchat.

Q: What role is this question designed for?

This question is commonly asked for Software Engineer candidates at Snapchat during technical interviews.

Question

Find minimum-latency path across dependent services

PracHub · Accepted Answer

This question evaluates understanding of graph algorithms and shortest-path computation on weighted directed graphs, including handling cycles, multiple edges, and reachability in service dependency models.

Quick Overview

Find minimum-latency path across dependent services