Add solution #1703

JoshCrozier · JoshCrozier · commit eed379518a0a · 2025-04-26T19:14:19.000-05:00
diff --git a/README.md b/README.md
@@ -1,4 +1,4 @@
-# 1,487 LeetCode solutions in JavaScript
+# 1,488 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1312,6 +1312,7 @@
 1700|[Number of Students Unable to Eat Lunch](./solutions/1700-number-of-students-unable-to-eat-lunch.js)|Easy|
 1701|[Average Waiting Time](./solutions/1701-average-waiting-time.js)|Medium|
 1702|[Maximum Binary String After Change](./solutions/1702-maximum-binary-string-after-change.js)|Medium|
+1703|[Minimum Adjacent Swaps for K Consecutive Ones](./solutions/1703-minimum-adjacent-swaps-for-k-consecutive-ones.js)|Hard|
 1716|[Calculate Money in Leetcode Bank](./solutions/1716-calculate-money-in-leetcode-bank.js)|Easy|
 1718|[Construct the Lexicographically Largest Valid Sequence](./solutions/1718-construct-the-lexicographically-largest-valid-sequence.js)|Medium|
 1726|[Tuple with Same Product](./solutions/1726-tuple-with-same-product.js)|Medium|
diff --git a/solutions/1703-minimum-adjacent-swaps-for-k-consecutive-ones.js b/solutions/1703-minimum-adjacent-swaps-for-k-consecutive-ones.js
@@ -0,0 +1,43 @@
+/**
+ * 1703. Minimum Adjacent Swaps for K Consecutive Ones
+ * https://leetcode.com/problems/minimum-adjacent-swaps-for-k-consecutive-ones/
+ * Difficulty: Hard
+ *
+ * You are given an integer array, nums, and an integer k. nums comprises of only 0's and 1's. In
+ * one move, you can choose two adjacent indices and swap their values.
+ *
+ * Return the minimum number of moves required so that nums has k consecutive 1's.
+ */
+
+/**
+ * @param {number[]} nums
+ * @param {number} k
+ * @return {number}
+ */
+var minMoves = function(nums, k) {
+  const ones = [];
+  for (let i = 0; i < nums.length; i++) {
+    if (nums[i] === 1) ones.push(i);
+  }
+
+  const prefixSum = [0];
+  for (let i = 0; i < ones.length; i++) {
+    prefixSum.push(prefixSum[i] + ones[i]);
+  }
+
+  let minSwaps = Infinity;
+  for (let i = 0; i <= ones.length - k; i++) {
+    const j = i + k - 1;
+    const mid = i + Math.floor(k / 2);
+    const target = ones[mid];
+    const leftCount = mid - i;
+    const rightCount = j - mid;
+    const leftSum = prefixSum[mid] - prefixSum[i];
+    const rightSum = prefixSum[j + 1] - prefixSum[mid + 1];
+    const swaps = (target * leftCount - leftSum) + (rightSum - target * rightCount);
+    minSwaps = Math.min(minSwaps, swaps);
+  }
+
+  const medianAdjust = Math.floor(k / 2) * Math.ceil(k / 2);
+  return minSwaps - medianAdjust;
+};
