Add solution #1674

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,466 LeetCode solutions in JavaScript
+# 1,467 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1290,6 +1290,7 @@
 1671|[Minimum Number of Removals to Make Mountain Array](./solutions/1671-minimum-number-of-removals-to-make-mountain-array.js)|Hard|
 1672|[Richest Customer Wealth](./solutions/1672-richest-customer-wealth.js)|Easy|
 1673|[Find the Most Competitive Subsequence](./solutions/1673-find-the-most-competitive-subsequence.js)|Medium|
+1674|[Minimum Moves to Make Array Complementary](./solutions/1674-minimum-moves-to-make-array-complementary.js)|Medium|
 1679|[Max Number of K-Sum Pairs](./solutions/1679-max-number-of-k-sum-pairs.js)|Medium|
 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|

solutions/1674-minimum-moves-to-make-array-complementary.js

@@ -0,0 +1,45 @@
+/**
+ * 1674. Minimum Moves to Make Array Complementary
+ * https://leetcode.com/problems/minimum-moves-to-make-array-complementary/
+ * Difficulty: Medium
+ *
+ * You are given an integer array nums of even length n and an integer limit. In one move, you
+ * can replace any integer from nums with another integer between 1 and limit, inclusive.
+ *
+ * The array nums is complementary if for all indices i (0-indexed), nums[i] + nums[n - 1 - i]
+ * equals the same number. For example, the array [1,2,3,4] is complementary because for all
+ * indices i, nums[i] + nums[n - 1 - i] = 5.
+ *
+ * Return the minimum number of moves required to make nums complementary.
+ */
+
+/**
+ * @param {number[]} nums
+ * @param {number} limit
+ * @return {number}
+ */
+var minMoves = function(nums, limit) {
+  const n = nums.length;
+  const delta = new Array(2 * limit + 2).fill(0);
+  let result = n;
+
+  for (let i = 0; i < n / 2; i++) {
+    const left = nums[i];
+    const right = nums[n - 1 - i];
+    const minSum = Math.min(left, right) + 1;
+    const maxSum = Math.max(left, right) + limit;
+    delta[2] += 2;
+    delta[minSum] -= 1;
+    delta[left + right] -= 1;
+    delta[left + right + 1] += 1;
+    delta[maxSum + 1] += 1;
+  }
+
+  let moves = 0;
+  for (let i = 2; i <= 2 * limit; i++) {
+    moves += delta[i];
+    result = Math.min(result, moves);
+  }
+
+  return result;
+};