Practice Robinhood Coding Question | Real Coding Interviews

Quick Summary

Model service dependencies as a directed acyclic graph (DAG) parsed from string definitions.
Propagate a single unit of load from the entry point through dependencies, accumulating overlapping contributions.
Compute and return the final load factor for every reachable service in lexicographical order.

What This Tests

Common Patterns

Graph Traversal

Topological Sort

Hashing

BFS

Test Cases

Input

Output

Expected