Search
⌘K
Leetcode 2624. Snail Traversal
Reshape a 1D array into a rowsCount x colsCount matrix filled column-by-column in a "snail" (vertical snake) pattern—first column top-to-bottom, next bottom-to-top, alternating—returning an empty array if rowsCount * colsCount != nums.length.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.