Problem · Graph
Resolve Task Dependencies
Problem statement
The problem statement continues
ProExamples
Example 1
n = 4mandatory = [[0,1],[2,3]]optional = [[1,2,7]]return = [0,1,2,3]All dependencies are already acyclic, so none is removed. The only valid order is [0,1,2,3].
FastPrep Pro
Reported in 1 Amazon interview this weekUnlock this recently reported problem
FastPrep Pro gives you full access to interview problems reported within the last week.
- Full problem statement and constraints
- 2 more worked examples, explained
- Guided hints and editorial
- Run your code on real test cases
$9/month
Pro subscription, billed yearly — or $19 month-to-month. Cancel anytime.
Free plan — 2 of 2 free unlocks used this week