LeetCode 2895: Minimum Processing Time Solution

Master LeetCode problem 2895 (Minimum Processing Time), a medium challenge, with our optimized solutions in Java, C++, and Python. Explore detailed explanations, test your code in our interactive editor, and prepare for coding interviews.

2895. Minimum Processing Time

Medium

Array Greedy Sorting

Problem Explanation

Explanation:

To solve this problem, we need to assign tasks to processors in a way that minimizes the total processing time. We can achieve this by sorting the tasks in decreasing order of time required and assigning them to processors with the shortest available processing time.

Sort the tasks in decreasing order of processing time.
Sort the processors in increasing order of availability time.
Assign tasks to processors in a way that minimizes the total processing time.
Calculate the time taken by each processor to complete all assigned tasks.
Return the maximum of the two processor times as the final result.

Time Complexity: O(n log n) where n is the number of processors. Space Complexity: O(n) for storing sorted tasks.

Solution Code

class Solution {
    public int minProcessingTime(int[] processorTime, int[] tasks) {
        Arrays.sort(tasks);
        Arrays.sort(processorTime);
        
        int n = processorTime.length;
        int totalTime1 = 0;
        int totalTime2 = 0;
        
        for (int i = 0; i < n; i++) {
            totalTime1 = Math.max(totalTime1, processorTime[i] + tasks[i]);
            totalTime2 = Math.max(totalTime2, processorTime[i] + tasks[i + n]);
        }
        
        return Math.max(totalTime1, totalTime2);
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 2895 (Minimum Processing Time)?

This page provides optimized solutions for LeetCode problem 2895 (Minimum Processing Time) in Java, C++, and Python, along with a detailed explanation and an interactive code editor to test your code.

What is the time complexity of LeetCode 2895 (Minimum Processing Time)?

The time complexity for LeetCode 2895 (Minimum Processing Time) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 2895 on DevExCode?

Yes, DevExCode provides an interactive code editor where you can write, test, and run your code for LeetCode 2895 in Java, C++, or Python.

Back to LeetCode Solutions