Add solution #1578

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,380 LeetCode solutions in JavaScript
+# 1,381 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1205,6 +1205,7 @@
 1575|[Count All Possible Routes](./solutions/1575-count-all-possible-routes.js)|Hard|
 1576|[Replace All ?'s to Avoid Consecutive Repeating Characters](./solutions/1576-replace-all-s-to-avoid-consecutive-repeating-characters.js)|Medium|
 1577|[Number of Ways Where Square of Number Is Equal to Product of Two Numbers](./solutions/1577-number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers.js)|Medium|
+1578|[Minimum Time to Make Rope Colorful](./solutions/1578-minimum-time-to-make-rope-colorful.js)|Medium|
 1598|[Crawler Log Folder](./solutions/1598-crawler-log-folder.js)|Easy|
 1657|[Determine if Two Strings Are Close](./solutions/1657-determine-if-two-strings-are-close.js)|Medium|
 1668|[Maximum Repeating Substring](./solutions/1668-maximum-repeating-substring.js)|Easy|

solutions/1578-minimum-time-to-make-rope-colorful.js

@@ -0,0 +1,46 @@
+/**
+ * 1578. Minimum Time to Make Rope Colorful
+ * https://leetcode.com/problems/minimum-time-to-make-rope-colorful/
+ * Difficulty: 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 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.
+ */
+
+/**
+ * @param {string} colors
+ * @param {number[]} neededTime
+ * @return {number}
+ */
+var minCost = function(colors, neededTime) {
+  let result = 0;
+  let i = 0;
+
+  while (i < colors.length - 1) {
+    if (colors[i] === colors[i + 1]) {
+      let maxTime = neededTime[i];
+      let sumTime = neededTime[i];
+      let j = i + 1;
+
+      while (j < colors.length && colors[j] === colors[i]) {
+        maxTime = Math.max(maxTime, neededTime[j]);
+        sumTime += neededTime[j];
+        j++;
+      }
+
+      result += sumTime - maxTime;
+      i = j;
+    } else {
+      i++;
+    }
+  }
+
+  return result;
+};