Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
- Binary Tree Inorder Traversal
Coding · Binary Tree · Depth-First Search · Stack
- Binary Tree Level Order Traversal
Coding
- Binary Tree Level Order Traversal II
Coding
- Binary Tree Postorder Traversal
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2624. Snail Traversal
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source