Algorithm · Google · Hard
We operate a set of interchangeable servers that run daily jobs. For one day, you are given intervals, where each entry has the form [jobId, start, end]. Times are integer minutes since midnight. Each window is half-open: [start, end), so a job ending at minute t does not overlap with a job starting at minute t. A physical server can handle only one distinct jobId at any minute. However, multiple intervals with the same jobId are treated as parts or retries of the same job,…
Checking your access…