search

utkarsh006 / LeetCode-Grind

This Repo is a one way solution to ace your Technical Interviews and crack your dream Job by upsolving LeetCode standard problems.
MIT License
50 stars 26 forks source link

Minimum Time to Make Rope Colorful (Oct 3rd Challange) #291

Closed sahooabhipsa10 closed 2 years ago

sahooabhipsa10 commented 2 years ago

Description

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 ith 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 ith balloon from the rope. Return the minimum time Bob needs to make the rope colorful.

Code of Conduct

utkarsh006 commented 2 years ago

Work only on one issue at a time.

sahooabhipsa10 commented 2 years ago

can you assign this to me now as I have completed the other issue?