Add solution #2379

Author: JoshCrozier

README.md

@@ -735,6 +735,7 @@
 2352|[Equal Row and Column Pairs](./2352-equal-row-and-column-pairs.js)|Medium|
 2364|[Count Number of Bad Pairs](./2364-count-number-of-bad-pairs.js)|Medium|
 2375|[Construct Smallest Number From DI String](./2375-construct-smallest-number-from-di-string.js)|Medium|
+2379|[Minimum Recolors to Get K Consecutive Black Blocks](./2379-minimum-recolors-to-get-k-consecutive-black-blocks.js)|Easy|
 2381|[Shifting Letters II](./2381-shifting-letters-ii.js)|Medium|
 2390|[Removing Stars From a String](./2390-removing-stars-from-a-string.js)|Medium|
 2396|[Strictly Palindromic Number](./2396-strictly-palindromic-number.js)|Medium|

solutions/2379-minimum-recolors-to-get-k-consecutive-black-blocks.js

@@ -0,0 +1,39 @@
+/**
+ * 2379. Minimum Recolors to Get K Consecutive Black Blocks
+ * https://leetcode.com/problems/minimum-recolors-to-get-k-consecutive-black-blocks/
+ * Difficulty: Easy
+ *
+ * You are given a 0-indexed string blocks of length n, where blocks[i] is either 'W' or 'B',
+ * representing the color of the ith block. The characters 'W' and 'B' denote the colors white
+ * and black, respectively.
+ *
+ * You are also given an integer k, which is the desired number of consecutive black blocks.
+ *
+ * In one operation, you can recolor a white block such that it becomes a black block.
+ *
+ * Return the minimum number of operations needed such that there is at least one occurrence
+ * of k consecutive black blocks.
+ */
+
+/**
+ * @param {string} blocks
+ * @param {number} k
+ * @return {number}
+ */
+var minimumRecolors = function(blocks, k) {
+  let count = 0;
+
+  for (let i = 0; i < k; i++) {
+    if (blocks[i] === 'W') count++;
+  }
+
+  let result = count;
+
+  for (let i = k; i < blocks.length; i++) {
+    if (blocks[i] === 'W') count++;
+    if (blocks[i - k] === 'W') count--;
+    result = Math.min(result, count);
+  }
+
+  return result;
+};