FastPrep
Problem · Matrix

Find Last Cell

● MediumCiscoINTERNNEW GRADOA
See Cisco hiring insights

Lucy loves to play the Hop, Skip and Jump game. Given an N*M matrix and starting from cell (1,1), her challenge is to hop in an anti-clockwise direction and skip alternate cells. The goal is to find out the last cell she would hop onto.

Write an algorithm to find the last cell Lucy would hop onto after moving anti-clockwise and skipping alternate cells.

Input

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

Output

Print an integer representing the last cell Lucy would hop onto after following the given instructions.

ᡣ˶ᵔ ᵕ ᵔ˶𐭩 Credit to Charlotte 🧡

Examples
01 · Example 1
matrix = [[29, 8, 37], [15, 41, 3], [1, 10, 14]]
return = 41
Lucy starts with 29, skips 15, hops onto 1, skip 10, hops onto 14, skips 3, hops onto 37, skips 8 and finally hops onto 41. So, the output is 41.
Constraints
🍓
More Cisco problems
drafts saved locally
public int findLastCell(int[][] matrix) {
  // write your code here
}
matrix[[29, 8, 37], [15, 41, 3], [1, 10, 14]]
expected41
sign in to submit