Add solution #2579

Author: JoshCrozier

README.md

@@ -711,6 +711,7 @@
 2535|[Difference Between Element Sum and Digit Sum of an Array](./2535-difference-between-element-sum-and-digit-sum-of-an-array.js)|Easy|
 2542|[Maximum Subsequence Score](./2542-maximum-subsequence-score.js)|Medium|
 2570|[Merge Two 2D Arrays by Summing Values](./2570-merge-two-2d-arrays-by-summing-values.js)|Easy|
+2579|[Count Total Number of Colored Cells](./2579-count-total-number-of-colored-cells.js)|Medium|
 2618|[Check if Object Instance of Class](./2618-check-if-object-instance-of-class.js)|Medium|
 2619|[Array Prototype Last](./2619-array-prototype-last.js)|Easy|
 2620|[Counter](./2620-counter.js)|Easy|

solutions/2579-count-total-number-of-colored-cells.js

@@ -0,0 +1,21 @@
+/**
+ * 2579. Count Total Number of Colored Cells
+ * https://leetcode.com/problems/count-total-number-of-colored-cells/
+ * Difficulty: Medium
+ *
+ * There exists an infinitely large two-dimensional grid of uncolored unit cells.
+ * You are given a positive integer n, indicating that you must do the following
+ * routine for n minutes:
+ * - At the first minute, color any arbitrary unit cell blue.
+ * - Every minute thereafter, color blue every uncolored cell that touches a blue cell.
+ *
+ * Below is a pictorial representation of the state of the grid after minutes 1, 2, and 3.
+ */
+
+/**
+ * @param {number} n
+ * @return {number}
+ */
+var coloredCells = function(n) {
+  return 1 + 2 * n * (n - 1);
+};