Limited Time Offer:Up to 25% off Hello Interview Premium

Back to Main

Your Dashboard

Learn Code

Introduction

Overview

Container With Most Water

Two Sum (Sorted Array)

3-Sum

Triangle Numbers

Move Zeroes

Sort Colors

Trapping Rain Water

Overview

Longest Substring Without Repeating Characters

Longest Repeating Character Replacement

Overview

Maximum Sum of Subarrays of Size K

Max Points You Can Obtain From Cards

Max Sum of Distinct Subarrays Length k

Overview

Can Attend Meetings

Insert Interval

Non-Overlapping Intervals

Merge Intervals

Employee Free Time

Overview

Valid Parentheses

Decode String

Longest Valid Parentheses

Overview

Daily Temperatures

Largest Rectangle in Histogram

Overview

Linked List Cycle

Palindrome Linked List

Remove Nth Node From End of List

Reorder List

Swap Nodes in Pairs

Overview

Apple Harvest (Koko Eating Bananas)

Search in Rotated Sorted Array

Overview

Kth Largest Element in an Array

K Closest Points to Origin

Find K Closest Elements

Merge K Sorted Lists

Introduction

Overview

Level Order Sum

Rightmost Node

Zigzag Level Order

Maximum Width of Binary Tree

Graphs Overview

Minimum Knight Moves

Rotting Oranges

01-Matrix

Bus Routes

Overview

Word Search

Solution Space Trees

Subsets

Generate Parentheses

Combination Sum

Overview

Course Schedule

Course Schedule II

Fundamentals

Solving a Question with Dynamic Programming

Counting Bits

Decode Ways

Maximal Square

Unique Paths

Longest Increasing Subsequence

Word Break

Maximum Profit in Job Scheduling

Overview

Best Time to Buy and Sell Stock

Gas Station

Jump Game

Overview

Implement Trie Methods

Prefix Matching

Overview

Count Vowels in Substrings

Subarray Sum Equals K

Spiral Matrix

Rotate Image

Set Matrix Zeroes

Vote For New Content

Pricing

Become a Coach

⌘K

Pricing Become a Coach

⌘K

Tutor

Get Premium

Matrices

Spiral Matrix

medium

DESCRIPTION (inspired by Leetcode.com)

Write a function to traverse an m x n matrix in spiral order and return all elements in a single list. The traversal should start from the top left corner and proceed clockwise, spiraling inward until every element has been visited.

Input:

matrix = [
    [0,1,2],
    [3,4,5],
    [6,7,8]
]

Output:

[0,1,2,5,8,7,6,3,4]

Explanation: The elements of the matrix are returned in the order they are visited in a clockwise spiral starting from the top left corner.

Explanation

This solution uses 4 steps to traverse the matrix in spiral order:

1. Top Row

The first step is to pop the first row of the matrix, while copying those elements into the result array from left to right.

Visualization


def spiral_order(matrix):
    result = []
    while matrix:
        result += matrix.pop(0)
        if matrix and matrix[0]:
            for row in matrix:
                result.append(row.pop())
        if matrix:
            result += matrix.pop()[::-1]
        if matrix and matrix[0]:
            for row in matrix[::-1]:
                result.append(row.pop(0))
    return result

initialize result

0 / 1

2. Right Column

Next, we traverse the right column of the matrix, popping the last element of each remaining row in matrix and copying those elements into the result array from top to bottom.

Visualization


def spiral_order(matrix):
    result = []
    while matrix:
        result += matrix.pop(0)
        if matrix and matrix[0]:
            for row in matrix:
                result.append(row.pop())
        if matrix:
            result += matrix.pop()[::-1]
        if matrix and matrix[0]:
            for row in matrix[::-1]:
                result.append(row.pop(0))
    return result

traverse top row

0 / 2

3. Bottom Row

Next, we traverse the bottom row of the matrix, popping the last row of matrix and copying those elements into the result array from right to left.

Visualization


def spiral_order(matrix):
    result = []
    while matrix:
        result += matrix.pop(0)
        if matrix and matrix[0]:
            for row in matrix:
                result.append(row.pop())
        if matrix:
            result += matrix.pop()[::-1]
        if matrix and matrix[0]:
            for row in matrix[::-1]:
                result.append(row.pop(0))
    return result

traverse right column

0 / 1

4. Left Column

Finally, we traverse the left column of the matrix, popping the first element of each remaining row in matrix and copying those elements into the result array from bottom to top.

Visualization


def spiral_order(matrix):
    result = []
    while matrix:
        result += matrix.pop(0)
        if matrix and matrix[0]:
            for row in matrix:
                result.append(row.pop())
        if matrix:
            result += matrix.pop()[::-1]
        if matrix and matrix[0]:
            for row in matrix[::-1]:
                result.append(row.pop(0))
    return result

traverse bottom row

0 / 1

Repeat

At this point, we have traversed the perimeter of the original matrix in a clockwise spiral order. We repeat the process for the inner submatrix, until there are no more elements left to traverse.

Visualization


def spiral_order(matrix):
    result = []
    while matrix:
        result += matrix.pop(0)
        if matrix and matrix[0]:
            for row in matrix:
                result.append(row.pop())
        if matrix:
            result += matrix.pop()[::-1]
        if matrix and matrix[0]:
            for row in matrix[::-1]:
                result.append(row.pop(0))
    return result

traverse left column

0 / 2

Solution

Visualization


def spiral_order(matrix):
    result = []
    while matrix:
        result += matrix.pop(0)
        if matrix and matrix[0]:
            for row in matrix:
                result.append(row.pop())
        if matrix:
            result += matrix.pop()[::-1]
        if matrix and matrix[0]:
            for row in matrix[::-1]:
                result.append(row.pop(0))
    return result

spiral matrix

0 / 8

Test Your Knowledge

Complexity Analysis

Time Complexity: O(m * n) where m is the number of rows and n is the number of columns. We visit each element in the matrix once.

Space Complexity: O(m * n) for the result array that stores all matrix elements.

Mark as read

Next: Rotate Image

Your account is free and you can post anonymously if you choose.

The best mocks on the market.

Now up to 15% off

Learn More

Reading Progress

On This Page

Explanation

1. Top Row

2. Right Column

3. Bottom Row

4. Left Column

Repeat

Solution

Matrices

Spiral Matrix

DESCRIPTION (inspired by Leetcode.com)

Explanation

1. Top Row

2. Right Column

3. Bottom Row

4. Left Column

Repeat

Solution

Test Your Knowledge

Complexity Analysis

The best mocks on the market.

Questions

Learn

Links

Legal

Contact