Skip to content

Practice Minimum Processing Time

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#2895
LeetCode Problem

Minimum Processing Time

Problem Statement

You have a certain number of processors, each having 4 cores. The number of tasks to be executed is four times the number of processors. Each task must be assigned to a unique core, and each core can only be used once. You are given an array processorTime representing the time each processor becomes available and an array tasks representing how long each task takes to complete. Return the minimum time needed to complete all tasks.

Source: Minimum Processing Time on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
processorTime = [8,10], tasks = [2,2,3,1,8,7,4,5]
Output
16

# Example 2

Input
processorTime = [10,20], tasks = [2,3,1,2,5,8,4,3]
Output
23

Constraints

1 <= n == processorTime.length <= 25000
1 <= tasks.length <= 10^5
0 <= processorTime[i] <= 10^9
1 <= tasks[i] <= 10^9
tasks.length == 4 * n

Related LeetCode Problems

Practice more problems similar to Minimum Processing Time.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.