LeetCode 2391: Minimum Amount of Time to Collect Garbage Solution

Master LeetCode problem 2391 (Minimum Amount of Time to Collect Garbage), 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.

2391. Minimum Amount of Time to Collect Garbage

Medium

Array String Prefix Sum

Problem Explanation

Explanation:

To solve this problem, we can simulate the process of each garbage truck picking up their respective garbage. We iterate through each house, calculate the time taken for each type of garbage truck to pick up the garbage at that house, and update the total time taken accordingly. We keep track of the time taken by each type of garbage truck separately and consider the maximum time taken overall.

Iterate through each house:
- Calculate the time taken by each type of garbage truck to pick up the garbage at that house.
- Update the total time taken by each type of garbage truck.
- Consider the maximum time taken among all garbage trucks.
Return the total time taken as the minimum amount of time to collect all garbage.

Time Complexity: O(n), where n is the number of houses. Space Complexity: O(1)

Solution Code

class Solution {
    public int minTimeToCollectGarbage(String[] garbage, int[] travel) {
        int metalTime = 0, paperTime = 0, glassTime = 0;
        
        for (int i = 0; i < garbage.length; i++) {
            for (char c : garbage[i].toCharArray()) {
                if (c == 'M') {
                    metalTime += travel[i];
                } else if (c == 'P') {
                    paperTime += travel[i];
                } else if (c == 'G') {
                    glassTime += travel[i];
                }
            }
        }
        
        return Math.max(metalTime, Math.max(paperTime, glassTime));
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 2391 (Minimum Amount of Time to Collect Garbage)?

This page provides optimized solutions for LeetCode problem 2391 (Minimum Amount of Time to Collect Garbage) 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 2391 (Minimum Amount of Time to Collect Garbage)?

The time complexity for LeetCode 2391 (Minimum Amount of Time to Collect Garbage) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 2391 on DevExCode?

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

Back to LeetCode Solutions