Day 28

#1578.minimum-time-to-make-rope-colorful:-



class Solution:
    def minCost(self, colors: str, neededTime: List[int]) -> int:
        total_time = 0
        i = 0
        n = len(colors)
        
        while i < n:
            j = i
            group_sum = 0
            group_max = 0
            
            # Traverse the group of same color
            while j < n and colors[j] == colors[i]:
                group_sum += neededTime[j]
                group_max = max(group_max, neededTime[j])
                j += 1
            
            # Remove all except one (max time one stays)
            total_time += (group_sum - group_max)
            i = j  # move to next group
        
        return total_time