← All problemsSign in

1260. Shift 2D Grid

LeetCodeArrayMatrixSimulationOpen on judge ↗

Given a 2D grid of size m x n and an integer k. You need to shift the grid k times. In one shift operation: - Element at grid[i][j] moves to grid[i][j + 1]. - Element at grid[i][n - 1] moves to grid[i + 1][0]. - Element at grid[m - 1][n - 1] moves to grid[0][0]. Return the 2D grid after applying shift operation k times. Example 1: Input: grid = [[1,2,3],[4,5,6],[7,8,9]], k = 1 Output: [[9

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start