Package g1701_1800.s1723_find_minimum_time_to_finish_all_jobs

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    1723 - Find Minimum Time to Finish All Jobs.

    Hard

    You are given an integer array jobs, where jobs[i] is the amount of time it takes to complete the <code>i<sup>th</sup></code> job.

    There are k workers that you can assign jobs to. Each job should be assigned to exactly one worker. The working time of a worker is the sum of the time it takes to complete all jobs assigned to them. Your goal is to devise an optimal assignment such that the maximum working time of any worker is minimized.

    Return the minimum possible maximum working time of any assignment.

    Example 1:

    Input: jobs = 3,2,3, k = 3

    Output: 3

    Explanation: By assigning each person one job, the maximum time is 3.

    Example 2:

    Input: jobs = 1,2,4,7,8, k = 2

    Output: 11

    Explanation: Assign the jobs the following way:

    Worker 1: 1, 2, 8 (working time = 1 + 2 + 8 = 11)

    Worker 2: 4, 7 (working time = 4 + 7 = 11)

    The maximum working time is 11.

    Constraints:

    • 1 &lt;= k &lt;= jobs.length &lt;= 12

    • <code>1 <= jobsi<= 10<sup>7</sup></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer minimumTimeRequired(IntArray jobs, Integer k)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait