You are given a string colors of length n, where colors[i] represents the color of the balloon at index i on a rope, and an integer array neededTime of length n, where neededTime[i] represents the time required to remove the balloon at index i from the rope.

The rope is colorful if no two adjacent balloons share the same color. Bob can remove balloons from the rope to achieve this configuration.

Return the minimum total time required to make the rope colorful.

Constraints:

• n $==$ colors.length $==$ neededTime.length

• $1 \leq$ n $\leq 10^5$

• $1 \leq$ neededTime[i] $\leq 10^4$

• colors contains only lowercase English letters.

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.