Skip to content

Practice Minimum Operations to Make a Uni-Value Grid

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#2033
LeetCode Problem

Minimum Operations to Make a Uni-Value Grid

Problem Statement

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.

Source: Minimum Operations to Make a Uni-Value Grid on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
grid = [[2,4],[6,8]], x = 2
Output
4

# Example 2

Input
grid = [[1,5],[2,3]], x = 1
Output
5

# Example 3

Input
grid = [[1,2],[3,4]], x = 2
Output
-1

Constraints

m == grid.length
n == grid[i].length
1 <= m, n <= 10^5
1 <= m * n <= 10^5
1 <= x, grid[i][j] <= 10^4

Related LeetCode Problems

Practice more problems similar to Minimum Operations to Make a Uni-Value Grid.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.