Apply For Jobs
Get Hiring UpdatesCognizant GenC Elevate Sample Coding Question 6
Question 6
In this article, we will discuss about Coding Question with their solution in java. This is a simple matrix based question in which we have to add the largest row sum and the largest column sum from an m*n matrix to help devilliers for finding his lucky number for the final match jersey.
Question 6
An astrologer gives a matrix to devilliers and tells him to add a largest row sum and largest column sum of the given matrix.The number which appears as a result is his lucky number for the final match jersey.
Write a program that adds up the largest row sum and the largest column sum from an N- rows*M-columns array of numbers to help devilliers for finding his lucky number for the final match jersey.
As a preliminary phrase , you should reformat the sequence of numbers as a matrix, whose number of rows and columns are to be specified as arguments.
Input Specification:
- Input 1: Integer for row dimension of the array
- Input 2: Integer for column dimension of the array
- Input 3: Array elements to be entered in row major.
Output Specifications:
- Largest row sum+ Largest column sum
Example 1:
Input1:4
Input2: 4
Input3: {1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4}
Output: 26
Explanation:
The array has 4 rows (input1) and 4 columns (input2). The largest sum among the four columns is 10 and the largest sum among the four rows is 16. We get the final sum of 26 (10+16).
Example 2:
Input1:2
Input2: 2
Input3: {1,2,5,6}
Output: 19
Explanation:
The array has 2 rows (input1) and 2 columns (input2). The elements in the first row are 1 and 2 and the elements in the second row are 5 and 6 (input3). The largest sum among the two columns is 8(2+6) By adding those two up. We get the final sum of 19 (11+8).
Example 3:
Input1: 3
Input2: 3
Input3: {3,6,9,1,4,7,2,8,9}
#include<iostream>
using namespace std;
int main ()
{
int N, M;
cout << "Enter number of rows : ";
cin >> N;
cout << "\nEnter number of columns : ";
cin >> M;
int Matrix[N][M];
cout << "\nEnter elements row-wise : \n";
for (int i = 0; i < N; i++)
{
for (int j = 0; j < M; j++)
{
cin >> Matrix[i][j];
}
}
int Row = 0;
for (int i = 0; i < N; i++)
{
int sum = 0;
for (int j = 0; j < M; j++)
{
sum = sum + Matrix[i][j];
}
if (Row < sum)
{
Row = sum;
}
}
int Column = 0;
for (int i = 0; i < M; i++)
{
int sum = 0;
for (int j = 0; j < N; j++)
{
sum = sum + Matrix[j][i];
}
if (Column < sum)
{
Column = sum;
}
}
int sum = Row + Column;
cout << sum;
return 0;
}
R,C=[],[]
m=int(input())
n=int(input())
arr=[]
for i in range(m):
arr.append(list(map(int,input().split())))
#finding sum of each row
for i in range(m):
sum=0
for j in range(n):
sum += arr[i][j]
R.append(sum)
#finding sum of each column
for i in range(m) :
sum=0
for j in range(n) :
sum += arr[j][i]
C.append(sum)
print(max(R)+max(C))
