Spiral matrix traversal
Given an m x n matrix (rows and columns may differ), return all its elements in spiral order: start at the top-left, go right across the top row, down the right column, left across the bottom, up the left column, then inward. 1 <= m, n <= 50. Return a flat list of the values in spiral sequence.
Implement
spiral_order(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 18 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