Problem title
Difficulty
Avg time to solve

Total Strings
Moderate
15 mins
Best Time to Buy and Sell Stock III
Hard
10 mins
Rotated Array
Moderate
10 mins
Russian Doll Envelopes
Hard
50 mins
Insert Interval
Easy
15 mins
Beautiful City
Easy
10 mins
Shortest Bridge
Moderate
35 mins
PRETTY JSON
Easy
10 mins
Check If One String Is A Rotation Of Another String
Easy
15 mins
Count Strings
Moderate
20 mins
3

# Ninja And The Rows

Difficulty: EASY
Contributed By
Avg. time to solve
15 min
Success Rate
87%

Problem Statement

#### 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.
``````
##### Input Format :
``````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.
``````
##### Constraints :
``````1 <= 'T' <= 10
1 <= 'N' <= 10^2
1 <= 'M' <= 10^2
0 <= 'MAT[I][J]' <= 10^5

Time Limit: 1 sec
``````
##### Sample Input 1 :
``````2
3 3
1 2 3
3 4 2
3 4 2
1 1
2
``````
##### Sample Output 1 :
``````9
2
``````
##### Explanation Of Sample Input 1 :
``````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.
``````
##### Sample Input 2 :
``````2
1 3
1 2 3
4 2
2 2
3 4
2 4
4 5
``````
##### Sample Output 2 :
``````6
9
``````
Console