Available question text
Given a directed acyclic graph representing service dependencies, calculate the worst-case load factor for each service, defined as the total units of load it receives when all upstream services make simultaneous requests starting from an entrypoint with 1 unit of load.
Related questions
Continue with questions that share topics or the same question type.
- Calculate Orders Within Each Interval
Coding
- Calculate the Influence of Each Salesperson
Coding
- Given an array of points where points[i] = [xi, yi] represents a point on the X-Y plane, return the k closest points to the origin (0, 0). Discuss expected vs. worst-case time complexity.
Coding
- Amount of New Area Painted Each Day
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Robinhood
Calculate Worst-Case Load Factor for Each Service in a DAG
Reported Sep 1, 2026 · 2 source reports
SENIOR
Source snapshot: Nov 12, 2026
View source