Available question text
Traverse the m×n grid in a row-wise zigzag (left-to-right on the first row, right-to-left on the next, etc.) starting at (0,0), and collect the values of every other visited cell (visit the first cell, skip the next, and repeat). Return the sequence of collected values in traversal order.
Related questions
Continue with questions that share topics or the same question type.
- Binary Tree Zigzag Level Order Traversal
Coding
- Grid Teleportation Traversal
Coding
- Add Consecutive-Value Bonuses to Grid Paths
Coding
- Binary Tree Inorder Traversal
Coding · Binary Tree · Depth-First Search · Stack
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 3417. Zigzag Grid Traversal With Skip
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source