Dependency Chain Status Query | Dataford Interview Questions

Can you explain how to build a dependency chain and query the status along that chain?

Implement the task as a function that returns every prerequisite of a target node followed by the target, with each node's status. The dependency graph is directed from a node to its immediate prerequisites, and the graph is guaranteed to be acyclic.

Input: a dependency dictionary, a status dictionary, and a target node. Output: a list of dictionaries in prerequisite-first order, each containing node and status.

Constraints

1 <= number of reachable nodes <= 1000
The dependency graph is directed and acyclic
Every referenced node has an entry in statuses
Dependency lists contain node names represented as strings
The target node may have no prerequisites

Function Signature

def dependency_chain_status(dependencies, statuses, target):

Your question is Dependency Chain Status Query. 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

Can you explain how to build a dependency chain and query the status along that chain?

Input: a dependency dictionary, a status dictionary, and a target node. Output: a list of dictionaries in prerequisite-first order, each containing node and status.

Constraints

1 <= number of reachable nodes <= 1000
The dependency graph is directed and acyclic
Every referenced node has an entry in statuses
Dependency lists contain node names represented as strings
The target node may have no prerequisites

Function Signature

def dependency_chain_status(dependencies, statuses, target):

Your question is Dependency Chain Status Query. 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.