Lexicographically Smallest Deployment Order | Dataford Interview Questions

Implement a small, functional deployment tool or script to handle a specific infrastructure task.

Implement deployment_order(services, dependencies), where services is an array of unique service names and dependencies is an array of pairs [service, prerequisite]. Return a valid deployment order that installs every prerequisite before its dependent, choosing the lexicographically smallest available service at each step; return an empty array if the dependencies contain a cycle.

Assume every dependency names a service in services.

Constraints

1 <= services.length <= 1000
All service names are unique non-empty strings
0 <= dependencies.length <= services.length * (services.length - 1)
Each dependency is a pair [service, prerequisite]
Every dependency names services from services
A dependency pair does not repeat

Function Signature

def deployment_order(services, dependencies):

Your question is Lexicographically Smallest Deployment Order. 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

Implement a small, functional deployment tool or script to handle a specific infrastructure task.

Assume every dependency names a service in services.

Constraints

1 <= services.length <= 1000
All service names are unique non-empty strings
0 <= dependencies.length <= services.length * (services.length - 1)
Each dependency is a pair [service, prerequisite]
Every dependency names services from services
A dependency pair does not repeat

Function Signature

def deployment_order(services, dependencies):

Your question is Lexicographically Smallest Deployment Order. 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.