> For the complete documentation index, see [llms.txt](https://coding-9.gitbook.io/untitled/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://coding-9.gitbook.io/untitled/array/matrix/54.-spiral-matrix.md).

# 54. Spiral Matrix

## Problem Statement

Given an `m x n` `matrix`, return *all elements of the* `matrix` *in spiral order*.

 

**Example 1:**

![](https://assets.leetcode.com/uploads/2020/11/13/spiral1.jpg)

<pre><code><strong>Input: matrix = [[1,2,3],[4,5,6],[7,8,9]]
</strong><strong>Output: [1,2,3,6,9,8,7,4,5]
</strong></code></pre>

**Example 2:**

![](https://assets.leetcode.com/uploads/2020/11/13/spiral.jpg)

<pre><code><strong>Input: matrix = [[1,2,3,4],[5,6,7,8],[9,10,11,12]]
</strong><strong>Output: [1,2,3,4,8,12,11,10,9,5,6,7]
</strong></code></pre>

&#x20;

**Constraints:**

* `m == matrix.length`
* `n == matrix[i].length`
* `1 <= m, n <= 10`
* `-100 <= matrix[i][j] <= 100`

## Intuition

```
Implementation
```

### Links

<https://leetcode.com/problems/spiral-matrix/description/>

### Video Links

<https://www.youtube.com/watch?v=3Zv-s9UUrFM>

### Approach 1:

```
```

{% code title="C++" lineNumbers="true" %}

```cpp
class Solution {
public:
    vector<int> spiralOrder(vector<vector<int>>& arr) {
        vector<int> ans;
        int m = arr.size();
        int n = arr[0].size();
        int top = 0, bottom = m-1;
        int left = 0, right = n-1;

        while(left<=right and top<=bottom){
            for(int i=left; i<=right; i++){
                ans.push_back(arr[top][i]);
            }
            top++;

            for(int i=top; i<=bottom; i++){
                ans.push_back(arr[i][right]);
            }
            right--;

            // For row matrix check
            if(top<=bottom){
                for(int i=right; i>=left; i--){
                    ans.push_back(arr[bottom][i]);
                }
                bottom--;
            }
            // For col matrix check
            if(left<=right){
                for(int i=bottom; i>=top; i--){
                    ans.push_back(arr[i][left]);
                }
                left++;
            }
        }

        return ans;
    }
};
```

{% endcode %}

### Approach 2:

```
```

{% code title="C++" lineNumbers="true" %}

```cpp
```

{% endcode %}

### Approach 3:

```
```

{% code title="C++" lineNumbers="true" %}

```cpp
```

{% endcode %}

### Approach 4:

```
```

{% code title="C++" lineNumbers="true" %}

```cpp
```

{% endcode %}

### Similar Problems

###