Problem bank
Problem 249 of 333MediumCodingP249
Earliest finish time for a job pipeline
An overnight risk pipeline has jobs with durations in hours:
prices3,fx1,returns2,risk4,report1. Dependencies:returnsneedspricesandfx;riskneedsreturns;reportneedsriskandfx. Any number of jobs can run in parallel once their prerequisites are done. What is the earliest time the whole pipeline can finish? Give an algorithm for the general case and its complexity.Check your answer and see the solution with a free account
Every problem on Quant Engine is free, with a hint and a full worked solution. Making an account takes 30 seconds and no card. Then you can write and check your answers, see the solutions, and track what you have solved.