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.
0
Hello Interview Premium
Your account is free and you can post anonymously if you choose.