Service Dependency Load | Dataford Interview Questions

Given a service dependency DAG as strings 'service=dep1,dep2' (ignore non-existent dependencies) and an entrypoint, return each reachable service's worst-case load factor as 'service*load' sorted by name.

Asked in the Virtual onsite: coding stage.

Implement def service_loads(dependencies, entrypoint):. Each dependency string defines one service. A defined service has load 1 + sum(load of each defined dependency). A service with no defined dependencies has load 1. Count repeated dependency references separately. Return a list of strings for every reachable, defined service, sorted lexicographically by service name.

Constraints

1 <= len(dependencies) <= 1,000
Each definition has the form service=dep1,dep2 or service=
Service names contain no commas or equals signs
The input definitions form a DAG
The entrypoint is defined
Repeated dependency references are counted separately

Function Signature

def service_loads(dependencies, entrypoint):

Your question is Service Dependency Load. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Asked in the Virtual onsite: coding stage.

Constraints

1 <= len(dependencies) <= 1,000
Each definition has the form service=dep1,dep2 or service=
Service names contain no commas or equals signs
The input definitions form a DAG
The entrypoint is defined
Repeated dependency references are counted separately

Function Signature

def service_loads(dependencies, entrypoint):

Your question is Service Dependency Load. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.