Practice Shift 2D Grid
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
Shift the m by n grid k times. Each shift moves every value one position to the right in row-major order: the last value of a row moves to the first column of the next row, and the bottom-right value wraps to the top-left cell. Return the grid after all shifts.
Source: Shift 2D Grid on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
grid = [[1,2,3],[4,5,6],[7,8,9]], k = 1
Output
[[9,1,2],[3,4,5],[6,7,8]]
# Example 2
Input
grid = [[3,8,1,9],[19,7,2,5],[4,6,11,10],[12,0,21,13]], k = 4
Output
[[12,0,21,13],[3,8,1,9],[19,7,2,5],[4,6,11,10]]
# Example 3
Input
grid = [[1,2,3],[4,5,6],[7,8,9]], k = 9
Output
[[1,2,3],[4,5,6],[7,8,9]]
Constraints
m == grid.length
n == grid[i].length
1 <= m <= 50
1 <= n <= 50
-1000 <= grid[i][j] <= 1000
0 <= k <= 100
Related LeetCode Problems
Practice more problems similar to Shift 2D Grid.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.