Add solution #1260

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,200 LeetCode solutions in JavaScript
+# 1,201 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -958,6 +958,7 @@
 1253|[Reconstruct a 2-Row Binary Matrix](./solutions/1253-reconstruct-a-2-row-binary-matrix.js)|Medium|
 1254|[Number of Closed Islands](./solutions/1254-number-of-closed-islands.js)|Medium|
 1255|[Maximum Score Words Formed by Letters](./solutions/1255-maximum-score-words-formed-by-letters.js)|Hard|
+1260|[Shift 2D Grid](./solutions/1260-shift-2d-grid.js)|Easy|
 1261|[Find Elements in a Contaminated Binary Tree](./solutions/1261-find-elements-in-a-contaminated-binary-tree.js)|Medium|
 1267|[Count Servers that Communicate](./solutions/1267-count-servers-that-communicate.js)|Medium|
 1268|[Search Suggestions System](./solutions/1268-search-suggestions-system.js)|Medium|

solutions/1260-shift-2d-grid.js

@@ -0,0 +1,37 @@
+/**
+ * 1260. Shift 2D Grid
+ * https://leetcode.com/problems/shift-2d-grid/
+ * Difficulty: Easy
+ *
+ * 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.
+ */
+
+/**
+ * @param {number[][]} grid
+ * @param {number} k
+ * @return {number[][]}
+ */
+var shiftGrid = function(grid, k) {
+  const rows = grid.length;
+  const cols = grid[0].length;
+  const total = rows * cols;
+
+  if (k === 0 || k % total === 0) return grid;
+
+  const effectiveShifts = k % total;
+  const flat = grid.flat();
+  const shifted = [...flat.slice(-effectiveShifts), ...flat.slice(0, -effectiveShifts)];
+  const result = [];
+  for (let i = 0; i < rows; i++) {
+    result.push(shifted.slice(i * cols, (i + 1) * cols));
+  }
+
+  return result;
+};