Spiral matrix traversal
Given an R x C integer matrix (possibly rectangular, not necessarily square), return all of its elements in clockwise spiral order starting from the top-left corner. The matrix has at least one row and one column.
Implement
spiral_read(matrix: list[list[int]]) → list[int]Examples
in
[[[1,2,3],[4,5,6],[7,8,9]]]out[1,2,3,6,9,8,7,4,5]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 20 min
solution.py
InputExpectedGot
[[[1,2,3],[4,5,6],[7,8,9]]][1,2,3,6,9,8,7,4,5]not run yetsample