25:I[830220,["/_next/static/chunks/8ac4bd2fce67e1ea.js?dpl=dpl_GguH2kshgLXP11ACWNYLTE44EP4r","/_next/static/chunks/d2a29c3d6d104500.js?dpl=dpl_GguH2kshgLXP11ACWNYLTE44EP4r","/_next/static/chunks/40a008f0d3b946c1.js?dpl=dpl_GguH2kshgLXP11ACWNYLTE44EP4r","/_next/static/chunks/e9800436660ed4ac.js?dpl=dpl_GguH2kshgLXP11ACWNYLTE44EP4r","/_next/static/chunks/aa0ad020a00247e7.js?dpl=dpl_GguH2kshgLXP11ACWNYLTE44EP4r"],"ProblemPracticeWorkspace"] 26:T460,function rotateGrid(grid, k) { const m = grid.length; const n = grid[0].length; const ans = grid.map((row) => [...row]); for (let top = 0, left = 0; top < Math.floor(m / 2) && left < Math.floor(n / 2); top++, left++) { const bottom = m - 1 - top; const right = n - 1 - left; const values = []; for (let col = left; col <= right; col++) values.push(grid[top][col]); for (let row = top + 1; row <= bottom; row++) values.push(grid[row][right]); for (let col = right - 1; col >= left; col--) values.push(grid[bottom][col]); for (let row = bottom - 1; row > top; row--) values.push(grid[row][left]); const shift = k % values.length; const rotated = values.slice(shift).concat(values.slice(0, shift)); let index = 0; for (let col = left; col <= right; col++) ans[top][col] = rotated[index++]; for (let row = top + 1; row <= bottom; row++) ans[row][right] = rotated[index++]; for (let col = right - 1; col >= left; col--) ans[bottom][col] = rotated[index++]; for (let row = bottom - 1; row > top; row--) ans[row][left] = rotated[index++]; } return ans; }27:T527,class Solution: def rotateGrid(self, grid, k): m, n = len(grid), len(grid[0]) ans = [row[:] for row in grid] for top in range(min(m, n) // 2): left = top bottom = m - 1 - top right = n - 1 - left values = [] for col in range(left, right + 1): values.append(grid[top][col]) for row in range(top + 1, bottom + 1): values.append(grid[row][right]) for col in range(right - 1, left - 1, -1): values.append(grid[bottom][col]) for row in range(bottom - 1, top, -1): values.append(grid[row][left]) shift = k % len(values) rotated = values[shift:] + values[:shift] index = 0 for col in range(left, right + 1): ans[top][col] = rotated[index] index += 1 for row in range(top + 1, bottom + 1): ans[row][right] = rotated[index] index += 1 for col in range(right - 1, left - 1, -1): ans[bottom][col] = rotated[index] index += 1 for row in range(bottom - 1, top, -1): ans[row][left] = rotated[index] index += 1 return ans28:T51e,class Solution { public: vector> rotateGrid(vector>& grid, int k) { int m = grid.size(); int n = grid[0].size(); vector> ans = grid; for (int top = 0; top < min(m, n) / 2; top++) { int left = top; int bottom = m - 1 - top; int right = n - 1 - left; vector values; for (int col = left; col <= right; col++) values.push_back(grid[top][col]); for (int row = top + 1; row <= bottom; row++) values.push_back(grid[row][right]); for (int col = right - 1; col >= left; col--) values.push_back(grid[bottom][col]); for (int row = bottom - 1; row > top; row--) values.push_back(grid[row][left]); int shift = k % values.size(); rotate(values.begin(), values.begin() + shift, values.end()); int index = 0; for (int col = left; col <= right; col++) ans[top][col] = values[index++]; for (int row = top + 1; row <= bottom; row++) ans[row][right] = values[index++]; for (int col = right - 1; col >= left; col--) ans[bottom][col] = values[index++];