Practice Find Minimum Time to Finish All Jobs
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Find Minimum Time to Finish All Jobs
Problem Statement
You are given an integer array jobs, where jobs[i] is the amount of time it takes to complete the ith 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.
Source: Find Minimum Time to Finish All Jobs on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
jobs = [3,2,3], k = 3
3
# Example 2
jobs = [1,2,4,7,8], k = 2
11
Constraints
Related LeetCode Problems
Practice more problems similar to Find Minimum Time to Finish All Jobs.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.