Parse and Schedule Workflow Commands | Dataford Interview Questions

Problem

Given a list of workflow step definitions as strings, implement a function that returns the executable steps in a valid order. Each definition has the form "step_name|deps|command", where deps is a comma-separated list of prerequisite step names or - if there are none. A step is executable only if all of its dependencies exist and appear earlier in the returned order. If the workflow contains a cycle, a missing dependency, or duplicate step names, return an empty list.

Constraints

1 <= len(steps) <= 10^4
Each string contains exactly two | separators
Step names are non-empty and unique in valid input
Total number of dependency references across all steps is at most 2 * 10^4

Problem

Constraints

1 <= len(steps) <= 10^4
Each string contains exactly two | separators
Step names are non-empty and unique in valid input
Total number of dependency references across all steps is at most 2 * 10^4

Problem

Constraints

1 <= len(steps) <= 10^4
Each string contains exactly two | separators
Step names are non-empty and unique in valid input
Total number of dependency references across all steps is at most 2 * 10^4

Problem

Constraints

1 <= len(steps) <= 10^4
Each string contains exactly two | separators
Step names are non-empty and unique in valid input
Total number of dependency references across all steps is at most 2 * 10^4