Tap here to switch tabs
Problem
Submissions

Problem: Diagonal Traverse

Diagonal Traverse asks you to return all elements of a rectangular integer matrix in diagonal order, alternating between upward-right and downward-left directions and visiting each value once.

Statement

Given an m×nm \times n integer matrix mat, return a list containing all elements of mat traversed in diagonal order.

In diagonal traversal, the diagonals alternate between moving upward-right and downward-left across the matrix, visiting every element exactly once.

Constraints:

  • m ==== mat.length

  • n ==== mat[i].length

  • 1≤1 \leq m, n ≤104\leq 10^4

  • 1≤1 \leq m ∗* n ≤104\leq 10^4

  • −105≤-10^5 \leq mat[i][j] ≤105\leq 10^5

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Diagonal Traverse

Diagonal Traverse asks you to return all elements of a rectangular integer matrix in diagonal order, alternating between upward-right and downward-left directions and visiting each value once.

Statement

Given an m×nm \times n integer matrix mat, return a list containing all elements of mat traversed in diagonal order.

In diagonal traversal, the diagonals alternate between moving upward-right and downward-left across the matrix, visiting every element exactly once.

Constraints:

  • m ==== mat.length

  • n ==== mat[i].length

  • 1≤1 \leq m, n ≤104\leq 10^4

  • 1≤1 \leq m ∗* n ≤104\leq 10^4

  • −105≤-10^5 \leq mat[i][j] ≤105\leq 10^5