grid with m rows and n columns and an integer steps. Imagine reading the cells row by row, like text, and closing them into a ring: after the last cell of a row comes the first cell of the next row, and after the very last cell of the grid comes the very first one.
In one step every number moves to the next cell of that ring:
- from grid[i][j] to grid[i][j + 1] if it is not the last column;
- from grid[i][n - 1] to grid[i + 1][0];
- from grid[m - 1][n - 1] to grid[0][0].
Return the grid after steps steps.grid=[[1, 2], [3, 4], [5, 6]], steps=1 → [[6, 1], [2, 3], [4, 5]]
Every number moves one cell right, 2 and 4 wrap to the start of the next row, and 6 from the last cell goes to the very first one.
grid=[[1, 2, 3], [4, 5, 6]], steps=3 → [[4, 5, 6], [1, 2, 3]]
Three steps in a grid three cells wide move everything exactly one row down, so the rows trade places.
grid=[[7, -7]], steps=4 → [[7, -7]]
The grid has two cells, so every two steps everything is back in place; after four steps the grid is unchanged.
m, n ≤ 50grid[i][j] ≤ 1000steps ≤ 100grid=[[1, 2], [3, 4], [5, 6]], steps=1
[[6, 1], [2, 3], [4, 5]]
Run checks the first 3 tests in your browser. Submit checks all 83 tests on the server, hidden ones included.