Dependency Resolution with Toposort | Dataford Interview Questions

Implement a topological sort algorithm to resolve dependencies between a set of tasks or packages.

Write topological_sort(tasks, dependencies), where tasks is a list of unique strings and each dependency [a, b] means a must be completed before b. Return any valid ordering containing every task exactly once, or return [] if the dependencies contain a cycle. Use the function signature and input shapes below.

Constraints

0 <= tasks.length <= 1000
0 <= dependencies.length <= 5000
Task names are unique strings
Every dependency references tasks in tasks
No duplicate dependency pairs are present
A dependency [a, b] means a must precede b

Function Signature

def topological_sort(tasks, dependencies):

Your question is Dependency Resolution with Toposort. 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 topological sort algorithm to resolve dependencies between a set of tasks or packages.

Constraints

0 <= tasks.length <= 1000
0 <= dependencies.length <= 5000
Task names are unique strings
Every dependency references tasks in tasks
No duplicate dependency pairs are present
A dependency [a, b] means a must precede b

Function Signature

def topological_sort(tasks, dependencies):

Your question is Dependency Resolution with Toposort. 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.