Task Ordering With Action History | Dataford Interview Questions

Explain how you would solve a task ordering problem that also requires tracking and handling the history of actions. Implement order_tasks(tasks, dependencies, actions), where dependencies are directed [before, after] pairs and actions are ['add', before, after], ['remove', before, after], or ['undo']. Return [ordering, history], using input order to break ties; return an empty ordering if the final dependency graph contains a cycle. History contains the zero-based indices of currently applied add/remove actions in chronological order.

Constraints

1 <= len(tasks) <= 2000
All task identifiers are unique and hashable
0 <= len(dependencies) <= 10000
0 <= len(actions) <= 10000
Every dependency references a task in tasks
Every add or remove action changes the current graph state
An undo with no active mutation is ignored
Actions are processed in order, and undo affects the most recent active add or remove action

Function Signature

def order_tasks(tasks, dependencies, actions):

Your question is Task Ordering With Action History. 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

Constraints

1 <= len(tasks) <= 2000
All task identifiers are unique and hashable
0 <= len(dependencies) <= 10000
0 <= len(actions) <= 10000
Every dependency references a task in tasks
Every add or remove action changes the current graph state
An undo with no active mutation is ignored
Actions are processed in order, and undo affects the most recent active add or remove action

Function Signature

def order_tasks(tasks, dependencies, actions):

Your question is Task Ordering With Action History. 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.