304 North Cardinal St.
Dorchester Center, MA 02124

# Minimum Amount of Time to Collect Garbage LeetCode Solution

## Problem – Minimum Amount of Time to Collect Garbage LeetCode Solution

You are given a 0-indexed array of strings `garbage` where `garbage[i]` represents the assortment of garbage at the `ith` house. `garbage[i]` consists only of the characters `'M'``'P'` and `'G'` representing one unit of metal, paper and glass garbage respectively. Picking up one unit of any type of garbage takes `1` minute.

You are also given a 0-indexed integer array `travel` where `travel[i]` is the number of minutes needed to go from house `i` to house `i + 1`.

There are three garbage trucks in the city, each responsible for picking up one type of garbage. Each garbage truck starts at house `0` and must visit each house in order; however, they do not need to visit every house.

Only one garbage truck may be used at any given moment. While one truck is driving or picking up garbage, the other two trucks cannot do anything.

Return the minimum number of minutes needed to pick up all the garbage.

Example 1:

``````Input: garbage = ["G","P","GP","GG"], travel = [2,4,3]
Output: 21
Explanation:
The paper garbage truck:
1. Travels from house 0 to house 1
2. Collects the paper garbage at house 1
3. Travels from house 1 to house 2
4. Collects the paper garbage at house 2
Altogether, it takes 8 minutes to pick up all the paper garbage.
The glass garbage truck:
1. Collects the glass garbage at house 0
2. Travels from house 0 to house 1
3. Travels from house 1 to house 2
4. Collects the glass garbage at house 2
5. Travels from house 2 to house 3
6. Collects the glass garbage at house 3
Altogether, it takes 13 minutes to pick up all the glass garbage.
Since there is no metal garbage, we do not need to consider the metal garbage truck.
Therefore, it takes a total of 8 + 13 = 21 minutes to collect all the garbage.
``````

Example 2:

``````Input: garbage = ["MMM","PGM","GP"], travel = [3,10]
Output: 37
Explanation:
The metal garbage truck takes 7 minutes to pick up all the metal garbage.
The paper garbage truck takes 15 minutes to pick up all the paper garbage.
The glass garbage truck takes 15 minutes to pick up all the glass garbage.
It takes a total of 7 + 15 + 15 = 37 minutes to collect all the garbage.``````

Constraints:

• `2 <= garbage.length <= 105`
• `garbage[i]` consists of only the letters `'M'``'P'`, and `'G'`.
• `1 <= garbage[i].length <= 10`
• `travel.length == garbage.length - 1`
• `1 <= travel[i] <= 100`

### Minimum Amount of Time to Collect Garbage LeetCode Solution in Java

``````    public int garbageCollection(String[] garbage, int[] travel) {
int last[] = new int[128], res = 0;
for (int i = 0; i < garbage.length; ++i) {
res += garbage[i].length();
for (int j = 0; j < garbage[i].length(); ++j)
last[garbage[i].charAt(j)] = i;
}
for (int j = 1; j < travel.length; ++j)
travel[j] += travel[j - 1];
for (int c : "PGM".toCharArray())
if (last[c] > 0)
res += travel[last[c] - 1];
return res;
}
``````

### Minimum Amount of Time to Collect Garbage LeetCode Solution in C++

``````    int garbageCollection(vector<string>& garbage, vector<int>& travel) {
int last[128] = {}, res = 0;
for (int i = 0; i < garbage.size(); ++i) {
res += garbage[i].size();
for (char c : garbage[i])
last[c] = i;
}
for (int j = 1; j < travel.size(); ++j)
travel[j] += travel[j - 1];
for (int c : "PGM")
if (last[c])
res += travel[last[c] - 1];
return res;
}``````

### Minimum Amount of Time to Collect Garbage LeetCode Solution in Python

``````    def garbageCollection(self, A: List[str], travel: List[int]) -> int:
last = {c: i for i,pgm in enumerate(A) for c in pgm}
dis = list(accumulate(travel, initial = 0))
return sum(map(len, A)) + sum(dis[last.get(c, 0)] for c in 'PGM')``````
##### Minimum Amount of Time to Collect Garbage LeetCode Solution Review:

In our experience, we suggest you solve this Minimum Amount of Time to Collect Garbage LeetCode Solution and gain some new skills from Professionals completely free and we assure you will be worth it.

If you are stuck anywhere between any coding problem, just visit Queslers to get the Minimum Amount of Time to Collect Garbage LeetCode Solution

Find on LeetCode

##### Conclusion:

I hope this Minimum Amount of Time to Collect Garbage LeetCode Solution would be useful for you to learn something new from this problem. If it helped you then don’t forget to bookmark our site for more Coding Solutions.

This Problem is intended for audiences of all experiences who are interested in learning about Data Science in a business context; there are no prerequisites.

Keep Learning!

More Coding Solutions >>

LeetCode Solutions

Hacker Rank Solutions

CodeChef Solutions