How should I practice Schedule Four Tasks per Processor?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Bloomberg LP phone screen problems in FastPrep.

Is Schedule Four Tasks per Processor associated with Bloomberg LP?

FastPrep tags this as a Bloomberg LP phone screen coding practice problem when the problem catalog has that company and stage context.

Schedule Four Tasks per Processor

Bloomberg LP● MediumFULLTIMEPHONE SCREEN

Learn

Problem statement

Processor i becomes available at processorTime[i] and has four cores. There are exactly four times as many independent tasks as processors. Assign exactly four tasks to each processor; its four tasks run simultaneously when it becomes available.

Return the earliest possible time when every task is finished.

Function

minTime(processorTime: int[], taskTime: int[]) → int

Examples

Example 1

processorTime = [8,10]taskTime = [2,2,3,1,8,7,4,5]return = 16

Assign the four longest tasks to the processor available at 8; the makespan is 8+8=16.

Constraints

taskTime.length == 4 * processorTime.length.
Times are nonnegative.