logoNEURAL COOK
SearchAll PostsTagsNotesAuthor
logoNEURAL COOK

A posts created with Next.js and Tailwind.css

Explore

  • All posts
  • Notes
  • Snippets
  • Tags
  • RSS feed

Connect

instagramtwitterfacebookyoutubelinkedinmailgithub

© 2026 VIKI. All rights reserved.

Built with
Contents
Table Of Contents
2. Add Two Numbers3. Longest Substring Without Repeating Characters5. Longest Palindromic Substring8. String to Integer (atoi)11. Container With Most Water15. 3Sum17. Letter Combinations of a Phone Number19. Remove Nth Node From End of List22. Generate Parentheses33. Search in Rotated Sorted Array34. Find First and Last Position of Element in Sorted Array48. Rotate Image49. Group Anagrams50. Pow(x, n)53. Maximum Subarray54. Spiral Matrix56. Merge Intervals61. Rotate List73. Set Matrix Zeroes74. Search a 2D Matrix75. Sort Colors78. Subsets137. Single Number II138. Copy List with Random Pointer150. Evaluate Reverse Polish Notation151. Reverse Words in a String153. Find Minimum in Rotated Sorted Array155. Min Stack162. Find Peak Element169. Majority Element198. House Robber207. Course Schedule215. Kth Largest Element in an Array227. Basic Calculator II236. Lowest Common Ancestor of a Binary Tree237. Delete Node in a Linked List238. Product of Array Except Self451. Sort Characters By Frequency540. Single Element in a Sorted Array560. Subarray Sum Equals K636. Exclusive Time of Functions875. Koko Eating Bananas1011. Capacity To Ship Packages Within D Days1101. The Earliest Moment When Everyone Become Friends1283. Find the Smallest Divisor Given a Threshold2140. Solving Questions With Brainpower3169. Count Days Without Meetings3481. Apply Substitutions
Code Scratch/leetcode/medium

54. Spiral Matrix

2 min read
On this pageIntitution
IntitutionComplexityCode

# Intitution

We need to simulate how a spiral moves through the matrix — from the top-left corner, moving right → down → left → up, and repeat while shrinking the boundaries.

To keep track of what’s been visited, we can shrink the four boundaries (top, bottom, left, right) after every full layer is traversed. This approach avoids using extra space for visited cells.

# Complexity

Space ComplexityTime Complexity
O(1)\text{O}(1)O(1)O(nm)\text{O}(nm)O(nm)

# Code

public List<Integer> spiralOrder(int[][] matrix) {
    int totalElements = matrix.length * matrix[0].length;
    List&lt;Integer&gt; result = new ArrayList<>();
 
    int leftBound = 0, rightBound = matrix[0].length - 1;
    int topBound = 0, bottomBound = matrix.length - 1;
 
    while (totalElements > 0) {
        // Traverse from left to right
        for (int col = leftBound; col &lt;= rightBound && totalElements &gt; 0; col++) {
            result.add(matrix[topBound][col]);
            totalElements--;
        }
        topBound++;
 
        // Traverse from top to bottom
        for (int row = topBound; row &lt;= bottomBound && totalElements &gt; 0; row++) {
            result.add(matrix[row][rightBound]);
            totalElements--;
        }
        rightBound--;
 
        // Traverse from right to left
        for (int col = rightBound; col >= leftBound && totalElements > 0; col--) {
            result.add(matrix[bottomBound][col]);
            totalElements--;
        }
        bottomBound--;
 
        // Traverse from bottom to top
        for (int row = bottomBound; row >= topBound && totalElements > 0; row--) {
            result.add(matrix[row][leftBound]);
            totalElements--;
        }
        leftBound++;
    }
 
    return result;
}
 
←Previous53. Maximum SubarrayNext→56. Merge Intervals

On this page

IntitutionComplexityCode