How should I practice Minimum Completion Time for DAG Dependencies?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Amazon phone screen and onsite interview problems in FastPrep.

Is Minimum Completion Time for DAG Dependencies associated with Amazon?

FastPrep tags this as a Amazon phone screen and onsite interview coding practice problem when the problem catalog has that company and stage context.

Minimum Completion Time for DAG Dependencies

Amazon● MediumNEW GRADFULLTIMEPHONE SCREENONSITE INTERVIEW

Problem statement

Each task has a positive duration. A dependency [before,after] means task after may start only after task before finishes. The dependency graph is acyclic.

The problem statement continues

Pro

Examples

Example 1

durations = [3,2,5]dependencies = [[0,2],[1,2]]return = 8

Tasks 0 and 1 run together; task 2 then finishes at time 8.

FastPrep Pro

Reported in 1 Amazon interview this week

Unlock 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

$8.25/month

$99 billed yearly — or $19 month-to-month. Cancel anytime.

Free plan — 2 of 2 free unlocks used this week

See Amazon hiring insights