← Questions
Minimum time to finish target courses in a prerequisite DAG
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Courses form a directed acyclic graph of prerequisites and each course takes a given time; any number of courses can run at once as soon as their prerequisites are done. Return the earliest time at which a given set of target courses is finished. Only the targets and what they depend on matter.
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