Given a list of start times for a task, and length of each task. Each task has the same length, find the min number of cpus needed to minimize the end time of the final task. I suggested binary search from 1 to n where n is the length of the start times, but interviewer said it was too ineficient. Any clue on how to solve this

EDIT - Each task can start on or after the start time. Therefore meeting rooms 2 does not work. Take example [0,0,0,10000] with task length 5. The answer would just be 1, but meeting rooms two would return 3.