Find minimum-latency path across dependent services

Company: Snapchat

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: hard

Interview Round: Technical Screen

Quick 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.