Scribd
Upload
40 views

Largest Row or Column

The document describes finding the row or column with the largest sum from a two-dimensional integer array. It provides instructions to output "row" followed by the index and sum if a row has the largest sum, or "column" followed by the index and sum if a column has the largest sum. It also specifies to consider the first row/column if there are multiple with the same maximum sum.

Uploaded by

ghch
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
40 views

Largest Row or Column

The document describes finding the row or column with the largest sum from a two-dimensional integer array. It provides instructions to output "row" followed by the index and sum if a row has the largest sum, or "column" followed by the index and sum if a column has the largest sum. It also specifies to consider the first row/column if there are multiple with the same maximum sum.

Uploaded by

ghch
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Largest Row or Column

Send Feedback
For a given two-dimensional integer array/list of size (N x M), you need to find out which row or
column has the largest sum(sum of all the elements in a row/column) amongst all the rows and
columns.
Note :
If there are more than one rows/columns with maximum sum, consider the row/column that comes
first. And if ith row and jth column has the same largest sum, consider the ith row as answer.
Input Format :
The first line contains an Integer 't' which denotes the number of test cases or queries to be run.
Then the test cases follow.

First line of each test case or query contains two integer values, 'N' and 'M', separated by a single
space. They represent the 'rows' and 'columns' respectively, for the two-dimensional array/list.

Second line onwards, the next 'N' lines or rows represent the ith row values.

Each of the ith row constitutes 'M' column values separated by a single space.
Output Format :
For each test case, If row sum is maximum, then print: "row" <row_index> <row_sum>
OR
If column sum is maximum, then print: "column" <col_index> <col_sum>
It will be printed in a single line separated by a single space between each piece of information.

Output for every test case will be printed in a seperate line.


 Consider :
If there doesn't exist a sum at all then print "row 0 -2147483648", where -2147483648 or -2^31 is
the smallest value for the range of Integer.
Constraints :
1 <= t <= 10^2
0 <= N <= 10^3
0 <= M <= 10^3
Time Limit: 1sec
Sample Input 1 :
1
22
11
11
Sample Output 1 :
row 0 2
Sample Input 2 :
2
33
369
147
289
42
12
90 100
3 40
-10 200
Sample Output 2 :
column 2 25
column 1 342

You might also like