Sync LeetCode submission Runtime - 139 ms (82.89%), Memory - 38.7 MB (97.37%)

Author: jimit105

2160-minimum-operations-to-make-a-uni-value-grid/README.md

@@ -0,0 +1,45 @@
+<p>You are given a 2D integer <code>grid</code> of size <code>m x n</code> and an integer <code>x</code>. In one operation, you can <strong>add</strong> <code>x</code> to or <strong>subtract</strong> <code>x</code> from any element in the <code>grid</code>.</p>
+
+<p>A <strong>uni-value grid</strong> is a grid where all the elements of it are equal.</p>
+
+<p>Return <em>the <strong>minimum</strong> number of operations to make the grid <strong>uni-value</strong></em>. If it is not possible, return <code>-1</code>.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+<img alt="" src="https://assets.leetcode.com/uploads/2021/09/21/gridtxt.png" style="width: 164px; height: 165px;" />
+<pre>
+<strong>Input:</strong> grid = [[2,4],[6,8]], x = 2
+<strong>Output:</strong> 4
+<strong>Explanation:</strong> We can make every element equal to 4 by doing the following: 
+- Add x to 2 once.
+- Subtract x from 6 once.
+- Subtract x from 8 twice.
+A total of 4 operations were used.
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+<img alt="" src="https://assets.leetcode.com/uploads/2021/09/21/gridtxt-1.png" style="width: 164px; height: 165px;" />
+<pre>
+<strong>Input:</strong> grid = [[1,5],[2,3]], x = 1
+<strong>Output:</strong> 5
+<strong>Explanation:</strong> We can make every element equal to 3.
+</pre>
+
+<p><strong class="example">Example 3:</strong></p>
+<img alt="" src="https://assets.leetcode.com/uploads/2021/09/21/gridtxt-2.png" style="width: 164px; height: 165px;" />
+<pre>
+<strong>Input:</strong> grid = [[1,2],[3,4]], x = 2
+<strong>Output:</strong> -1
+<strong>Explanation:</strong> It is impossible to make every element equal.
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>m == grid.length</code></li>
+	<li><code>n == grid[i].length</code></li>
+	<li><code>1 &lt;= m, n &lt;= 10<sup>5</sup></code></li>
+	<li><code>1 &lt;= m * n &lt;= 10<sup>5</sup></code></li>
+	<li><code>1 &lt;= x, grid[i][j] &lt;= 10<sup>4</sup></code></li>
+</ul>

2160-minimum-operations-to-make-a-uni-value-grid/solution.py

@@ -0,0 +1,29 @@
+# Approach 1: Sorting and Median
+
+# m = no. of rows, n = no. of cols
+# Time: O(m * n * log mn)
+# Space: O(m * n)
+
+
+class Solution:
+    def minOperations(self, grid: List[List[int]], x: int) -> int:
+        nums_array = []
+        result = 0
+
+        for row in grid:
+            for num in row:
+                nums_array.append(num)
+
+        nums_array.sort()
+
+        length = len(nums_array)
+        final_common_number = nums_array[length // 2]
+
+        for number in nums_array:
+            if number % x != final_common_number % x:
+                return -1
+
+            result += abs(final_common_number - number) // x
+
+        return result
+