Algorithm
LeetCode 1578 Solution
Minimum Time to make rope colorful #greedy #medium Alice has n balloons arranged on a rope. You are given a 0-indexed string colors where colors[i] is the color of the ith balloon. Alice wants the rope to be colorful. She does not want two consecutive balloons to be of