← Questions
Minimum time to finish dependent steps run in parallel
0
I was asked this
No reports yet. Sign in to say where you were asked it.
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.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding