Diagonal matrix traversal
Given an m x n matrix, return all its elements in DIAGONAL order: traverse the anti-diagonals starting from the top-left, where the first diagonal goes up-right, the next goes down-left, alternating direction on each successive diagonal. For [[1,2,3],[4,5,6],[7,8,9]] the output is [1,2,4,7,5,3,6,8,9]. Dimensions up to 10^4 total elements.
Implement
diagonal_order(matrix: list[list[int]]) → list[int]Examples
in
[[[1,2,3],[4,5,6],[7,8,9]]]out[1,2,4,7,5,3,6,8,9]What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 25 min
solution.py
InputExpectedGot
[[[1,2,3],[4,5,6],[7,8,9]]][1,2,4,7,5,3,6,8,9]not run yetsample