Add solution #2033

Author: JoshCrozier

README.md

@@ -896,6 +896,7 @@
 2016|[Maximum Difference Between Increasing Elements](./solutions/2016-maximum-difference-between-increasing-elements.js)|Easy|
 2017|[Grid Game](./solutions/2017-grid-game.js)|Medium|
 2027|[Minimum Moves to Convert String](./solutions/2027-minimum-moves-to-convert-string.js)|Easy|
+2033|[Minimum Operations to Make a Uni-Value Grid](./solutions/2033-minimum-operations-to-make-a-uni-value-grid.js)|Medium|
 2037|[Minimum Number of Moves to Seat Everyone](./solutions/2037-minimum-number-of-moves-to-seat-everyone.js)|Easy|
 2047|[Number of Valid Words in a Sentence](./solutions/2047-number-of-valid-words-in-a-sentence.js)|Easy|
 2053|[Kth Distinct String in an Array](./solutions/2053-kth-distinct-string-in-an-array.js)|Medium|

solutions/2033-minimum-operations-to-make-a-uni-value-grid.js

@@ -0,0 +1,34 @@
+/**
+ * 2033. Minimum Operations to Make a Uni-Value Grid
+ * https://leetcode.com/problems/minimum-operations-to-make-a-uni-value-grid/
+ * Difficulty: Medium
+ *
+ * You are given a 2D integer grid of size m x n and an integer x. In one operation, you can add x
+ * to or subtract x from any element in the grid.
+ *
+ * A uni-value grid is a grid where all the elements of it are equal.
+ *
+ * Return the minimum number of operations to make the grid uni-value. If it is not possible,
+ * return -1.
+ */
+
+/**
+ * @param {number[][]} grid
+ * @param {number} x
+ * @return {number}
+ */
+var minOperations = function(grid, x) {
+  if (values.length === 1) return 0;
+  const values = grid.flat();
+  values.sort((a, b) => a - b);
+  const median = values[Math.floor(values.length / 2)];
+  let operations = 0;
+
+  for (const value of values) {
+    const diff = Math.abs(value - median);
+    if (diff % x !== 0) return -1;
+    operations += diff / x;
+  }
+
+  return operations;
+};