chore: add LeetCode daily solution

Author: TechnoBlogger14o3

Medium/2025-11-03-1578-Minimum-Time-to-Make-Rope-Colorful/explanation.md

@@ -0,0 +1,30 @@
+# Minimum Time to Make Rope Colorful (Medium)
+
+**Problem ID:** 1578  
+**Date:** 2025-11-03  
+**Link:** https://leetcode.com/problems/minimum-time-to-make-rope-colorful/
+
+## Approach
+
+To solve the problem of making the rope colorful by removing the minimum time of balloons, we can utilize a greedy approach. The main idea is to iterate through the `colors` string and identify consecutive balloons of the same color. For each group of consecutive balloons, we will determine which ones to remove based on the time required to remove them, aiming to keep the balloon with the maximum removal time.
+
+### Approach:
+
+1. **Initialization**: Start with a variable to track the total time needed to remove balloons (`totalRemovalTime`) initialized to zero.
+
+2. **Iterate through the colors**: Use a loop to traverse the `colors` string. For each balloon, check if it is the same color as the previous one.
+
+3. **Group Consecutive Balloons**: If two consecutive balloons are of the same color, compare their removal times:
+   - Keep the balloon with the maximum removal time and add the removal time of the other balloon to `totalRemovalTime`.
+   - Continue this for the entire string.
+
+4. **Edge Cases**: If there are no consecutive balloons of the same color, the total removal time remains zero.
+
+### Data Structures:
+- We primarily use simple variables to track the current balloon and the total removal time, so no complex data structures are necessary.
+
+### Complexity:
+- **Time Complexity**: O(n), where n is the length of the `colors` string. We make a single pass through the string.
+- **Space Complexity**: O(1), as we are using a constant amount of space for our variables.
+
+This approach efficiently calculates the minimum time required to make the rope colorful by systematically removing the least costly balloons in groups of consecutive colors.

Medium/2025-11-03-1578-Minimum-Time-to-Make-Rope-Colorful/solution.java

@@ -0,0 +1,18 @@
+class Solution {
+    public int minCost(String colors, int[] neededTime) {
+        int totalCost = 0;
+        int maxTime = 0;
+        int n = colors.length();
+        
+        for (int i = 0; i < n; i++) {
+            if (i > 0 && colors.charAt(i) == colors.charAt(i - 1)) {
+                totalCost += Math.min(maxTime, neededTime[i]);
+                maxTime = Math.max(maxTime, neededTime[i]);
+            } else {
+                maxTime = neededTime[i];
+            }
+        }
+        
+        return totalCost;
+    }
+}

Medium/2025-11-03-1578-Minimum-Time-to-Make-Rope-Colorful/solution.js

@@ -0,0 +1,15 @@
+var minCost = function(colors, neededTime) {
+    let totalCost = 0;
+    let maxTime = 0;
+    
+    for (let i = 0; i < colors.length; i++) {
+        if (i > 0 && colors[i] === colors[i - 1]) {
+            totalCost += Math.min(maxTime, neededTime[i]);
+            maxTime = Math.max(maxTime, neededTime[i]);
+        } else {
+            maxTime = neededTime[i];
+        }
+    }
+    
+    return totalCost;
+};

Medium/2025-11-03-1578-Minimum-Time-to-Make-Rope-Colorful/solution.py

@@ -0,0 +1,13 @@
+class Solution:
+    def minCost(self, colors: str, neededTime: List[int]) -> int:
+        total_time = 0
+        max_time = 0
+        
+        for i in range(len(colors)):
+            if i > 0 and colors[i] == colors[i - 1]:
+                total_time += min(max_time, neededTime[i])
+                max_time = max(max_time, neededTime[i])
+            else:
+                max_time = neededTime[i]
+        
+        return total_time

README.md

@@ -267,3 +267,4 @@ Through completing the Blind 75 and NeetCode 150, you will have mastered:
 - 2025-10-31 — [The Two Sneaky Numbers of Digitville](https://leetcode.com/problems/the-two-sneaky-numbers-of-digitville/) (Easy) → `Easy/2025-10-31-3289-The-Two-Sneaky-Numbers-of-Digitville`
 - 2025-11-01 — [Delete Nodes From Linked List Present in Array](https://leetcode.com/problems/delete-nodes-from-linked-list-present-in-array/) (Medium) → `Medium/2025-11-01-3217-Delete-Nodes-From-Linked-List-Present-in-Array`
 - 2025-11-02 — [Count Unguarded Cells in the Grid](https://leetcode.com/problems/count-unguarded-cells-in-the-grid/) (Medium) → `Medium/2025-11-02-2257-Count-Unguarded-Cells-in-the-Grid`
+- 2025-11-03 — [Minimum Time to Make Rope Colorful](https://leetcode.com/problems/minimum-time-to-make-rope-colorful/) (Medium) → `Medium/2025-11-03-1578-Minimum-Time-to-Make-Rope-Colorful`