Quick Overview

Compute exact service load factors as one entry request propagates through a dependency DAG and converging paths accumulate. The question defines unreachable services, lexical output order, arbitrary-size decimal results, and a portable interface for large service graphs.

Compute Load Factors in a Service Dependency DAG

Company: Robinhood

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: medium

Interview Round: Technical Screen

Overview: Compute exact service load factors as one entry request propagates through a dependency DAG and converging paths accumulate. The question defines unreachable services, lexical output order, arbitrary-size decimal results, and a portable interface for large service graphs.

Read the full Robinhood Software Engineer interview experience this question came from

Loading…