Available question text
Cyclically shift an m x n matrix right by k positions where each element moves to the next column and wraps row-wise (last element goes to grid[0][0]). The problem reduces to rotating the flattened m*n array by k mod (m*n) and remapping it back into 2D.
Related questions
Continue with questions that share topics or the same question type.
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 1260. Shift 2D Grid
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source