Problem · Matrix

Find Elements Largest in Row Smallest in Column

Learn this problem
EasyCisco logoCiscoFULLTIMEOA
See Cisco hiring insights

Problem statement

Write an algorithm which finds out the elements which are largest in a row and smallest in a column in a matrix.

Input

The first line of input consists of two space-separated integers- matrix_row and matrix_col, representing the number of rows in the matrix (N) and the number of columns in the matrix (M), respectively. The next M lines consist of N space-separated integers representing the elements of the matrix.

Output

Print a number which is largest in a row and smallest in a column in the given matrix. If no element is found print '-1'.

Note

Each number in the matrix is a non-negative integer.

Function

findElementLargestInRowSmallestInColumn(matrix: int[][]) → int

Examples

Example 1

matrix = [[1, 2], [3, 4]]return = 2
The number 2 at index (0,1) is the largest in its row and smallest in its column. So, the output is 2.

Constraints

1 ≤ N, M ≤ 1000

More Cisco problems

drafts saved locally
public int findElementLargestInRowSmallestInColumn(int[][] matrix) {
  // write your code here
}
matrix[[1, 2], [3, 4]]
expected2
checking account