You are given a $0$ indexed array of strings garbage, where garbage[i] represents the assortment of garbage at the $i^{ ext{th}}$ house. Each character in garbage[i] represents one unit of garbage: 'M' for metal, 'P' for paper, and 'G' for glass. Collecting any single unit of garbage takes $1$ minute.

You are also given a $0$ indexed integer array travel, where travel[i] denotes the number of minutes required to travel from house i to house i + 1.

There are $3$ garbage trucks, with each truck assigned to collect exclusively one type of garbage. All trucks start at house $0$ and must visit houses in sequential order. A truck travels only as far as the last house that contains its assigned garbage type and does not need to visit any subsequent houses.

Return the minimum total number of minutes required to collect all the garbage from all houses.

Constraints:

• $2 \leq$ garbage.length $\leq 10^5$

• garbage[i] consists of only the letters 'M', 'P', and 'G'.

• $1 \leq$ garbage[i].length $\leq 10$

• travel.length $=$ garbage.length $- 1$

• $1 \leq$ travel[i] $\leq 100$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.