Back to problems

Maximum Concurrent Processes from Intervals

Algorithm · Amazon · Medium

Requirements Input consists of process execution ranges written as [start, end]. Determine the largest number of processes that are active simultaneously anywhere on the time axis. Examples Return the highest active-process total using the endpoint rule confirmed by the interviewer. With inclusive end times, the result is 3 because every interval includes time 4; with half-open intervals, the result is 2 because the first process has ended when the third begins. Preparation…

Checking your access…