Matrix Spiral Traversal

Function Name: spiralTraversal

Description

Write a function that takes a two-dimensional array (matrix) of MxN elements and returns an array of all elements in spiral order.

The function should start at the top-left corner and proceed in a spiral pattern until every element has been visited, moving in the order of right, down, left, and up sides of the matrix's boundary.

Consider that the input matrix can be of any size, but it is guaranteed to be non-empty.

Requirements

• The function spiralTraversal must take one parameter - a two-dimensional array (matrix).
• The function should not modify the input matrix.
• The function must return a flat array containing elements in the order they were visited during the spiral traversal.
• Optimize the function for readability and efficiency.

Examples

Given the following 2D array (matrix): [[1, 2, 3], [4, 5, 6], [7, 8, 9]], the function spiralTraversal should return [1, 2, 3, 6, 9, 8, 7, 4, 5].For a matrix [[1, 2, 3, 4]], the function should return [1, 2, 3, 4].For a matrix [[1], [2], [3], [4]], the function should return [1, 2, 3, 4].

Links