Problem of the day
Ninja has been provided a matrix 'MAT' of size 'N X M' where 'M' is the number of columns in the matrix, and 'N' is the number of rows.
The weight of the particular row is the sum of all elements in it. Ninja wants to find the maximum weight amongst all the rows.
Your task is to help the ninja find the maximum weight amongst all the rows.
EXAMPLE:Input: 'N' = 2, 'M' = 3, 'MAT' = [[1, 2, 3], [2, 0, 0]]
Output: 6
The weight of first row is 1 + 2 + 3 = 6
The weight of the second row is 2 + 0 + 0 = 2; hence the answer will be a maximum of 2 and 6, which is 6.
The first line of input contains an integer 'T', denoting the number of test cases.
For each test case, the first line will contain two integers, 'N' and 'M' number of rows and columns in the matrix. Next, 'N' lines will contain 'M' integers for each of the matrix elements.
Output format :
For each test case, print the maximum weight amongst all the rows.
Note :
You don't need to print anything. It has already been taken care of. Just implement the given function.
1 <= 'T' <= 10
1 <= 'N' <= 10^2
1 <= 'M' <= 10^2
0 <= 'MAT[I][J]' <= 10^5
Time Limit: 1 sec
2
3 3
1 2 3
3 4 2
3 4 2
1 1
2
9
2
For the first test case, the answer will be 9. It will be formed by the 2nd row, and it will be the maximum amongst all.
For the first test case, as there is only one row, the answer will be its sum which is 2.
2
1 3
1 2 3
4 2
2 2
3 4
2 4
4 5
6
9
Can you iterate over all the rows?
Approach: In this approach, we will simply iterate over all the rows of the matrix and calculate the sum of each row. after that, we will track the maximum amongst all the sums, and the answer will be that maximum sum.
Algorithm :
O(N * M), Where 'N' is the number of rows, and 'M' is the number of columns in the input matrix.
As we are iterating over the matrix of size 'N X M', the time complexity will be O(N * M).
O(1)
As we are using constant extra space, the space complexity will be O(1)