PROBLEM OF THE DAY: 22/08/2023 | Make Matrix Beautiful
source link: https://www.geeksforgeeks.org/videos/problem-of-the-day-22082023-make-matrix-beautiful/
Go to the source link to view the article. You can view the picture content, updated content and better typesetting reading experience. If the link is broken, please click the button below to view the snapshot at that time.
PROBLEM OF THE DAY: 22/08/2023
Welcome to the daily solving of our PROBLEM OF THE DAY with Jay Dalsaniya. We will discuss the entire problem step-by-step and work towards developing an optimized solution. This will not only help you brush up on your concepts of Matrix but will also help you build up problem-solving skills.
In this video, we are given a beautiful matrix in which the sum of elements in each row and column is equal. Given a square matrix of size NxN. Our task is to 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 :
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 of 4 operations are required.
Give the problem a try before going through the video. All the best!!!
Problem Link: https://practice.geeksforgeeks.org/problems/make-matrix-beautiful-1587115620/1
Solution IDE Link: https://ide.geeksforgeeks.org/online-java-compiler/b0bfe183-562b-42c4-9360-ecb72e00d270
Recommend
About Joyk
Aggregate valuable and interesting links.
Joyk means Joy of geeK