Minimum Time to Make Rope Colorful
Alice has n balloons arranged on a rope. You are given a 0-indexed string colors where colors[i] is the color of the i^th balloon.
Alice wants the rope to be colorful. She does not want two consecutive balloons to be of the same color, so she asks Bob for help. Bob can remove some balloons from the rope to make it colorful. You are given a 0-indexed integer array neededTime where neededTime[i] is the time in seconds that Bob needs to remove the i^th balloon from the rope.
Return the minimum time Bob needs to make the rope colorful.
Example 1
Input
colors = "abaac", neededTime = [1,2,3,4,5]Output
3Bob can remove the balloon at index 2, which takes 3 seconds, leaving no two consecutive balloons with the same color.
Example 2
Input
colors = "abc", neededTime = [1,2,3]Output
0The rope is already colorful, so Bob does not need to remove any balloons.
Constraints
- n == colors.length == neededTime.length
- 1 <= n <= 10^5
- 1 <= neededTime[i] <= 10^4
- colors contains only lowercase English letters.
Asked at 3 companies
Practice questions like this out loud in a mock coding interview with a live AI interviewer. First one free.