Geeksforgeeks

Error

×

A beautiful matrix is a matrix in which the sum of elements in each row and column is equal.

Given a square matrix of size NxN. Find the minimum number of operation(s) that are required to make the matrix beautiful. In one operation you can increment the value of any one cell by 1.

**Example 1:**

**Input**:
N = 2
matrix[][] = {{1, 2},
{3, 4}}
**Output**: 4
**Explanation**:
Updated matrix:
4 3
3 4
1. Increment value of cell(0, 0) by 3
2. Increment value of cell(0, 1) by 1
Hence total 4 operation are required.

**Example 2:**

**Input**:
N = 3
matrix[][] = {{1, 2, 3},
{4, 2, 3},
{3, 2, 1}}
**Output**: 6
**Explanation**:
Original matrix is as follows:
1 2 3
4 2 3
3 2 1
We need to make increment in such a way
that each row and column has one time 2,
one time 3 , one time 4. For that we
need 6 operations.

**Your Task: **

You don't need to read input or print anything. Complete the function **findMinOpeartion() **that takes **matrix and n** as input **parameters **and returns the **minimum number of operations**.

**Expected Time Complexity:** O(N * N)

**Expected Auxiliary Space:** O(N)

**Constraints:**

1 <= N <= 100

1 <= matrix[i][j] <= 200

We are replacing the old Disqus forum with the new Discussions section given below.

Click here to view old Disqus comments.

Click here to view old Disqus comments.

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

YesLoading...

Make Matrix Beautiful

...