Minimum time to finish dependent steps run in parallel
A job is split into n steps numbered 0 to n - 1; step i takes durations[i] minutes. A pair [u, v] in dependencies means step u must finish before step v starts. Any number of steps can run at once when their prerequisites are done. Return the minimum time to finish every step.
AmazonTechnical phone screenNo answer yet. Write the first one; the best answer gets endorsed.