Company: uber_13oct
Difficulty: medium
Load Balancing Problem Description Develop a prototype for a resource allocation system within a distributed parallel computing framework. You have n resources and m tasks to schedule, where the i th task has a processing time of burstTime[i] . The total load time of a resource is the sum of the burst times of the jobs assigned to it. Each resource can only be allocated jobs in a contiguous segment, i.e., from some index x to some index y or [x, x + 1, x + 2, ..., y] . Determine the minimum possible value of the maximum total load time across all resources. Complete the function getMinMaxLoadTime in the editor with the following parameter(s): int n : the number of resources. int burstTime[] : the burst time of jobs. Returns: long int : the minimum max load time of the job schedule. Examples Example 1: Input: n = 3 m = 6 burstTime = [4, 3, 2, 2, 2, 6] An optimal resource allocation is shown: Server Jobs Total Load Time 1 4, 3 4 + 3 = 7 2 2, 2, 2 2 + 2 + 2 = 6 3 6 6 Explanation: Here, th