Add solution #1981

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,667 LeetCode solutions in JavaScript
+# 1,668 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1520,6 +1520,7 @@
 1977|[Number of Ways to Separate Numbers](./solutions/1977-number-of-ways-to-separate-numbers.js)|Hard|
 1979|[Find Greatest Common Divisor of Array](./solutions/1979-find-greatest-common-divisor-of-array.js)|Easy|
 1980|[Find Unique Binary String](./solutions/1980-find-unique-binary-string.js)|Medium|
+1981|[Minimize the Difference Between Target and Chosen Elements](./solutions/1981-minimize-the-difference-between-target-and-chosen-elements.js)|Medium|
 1985|[Find the Kth Largest Integer in the Array](./solutions/1985-find-the-kth-largest-integer-in-the-array.js)|Medium|
 1996|[The Number of Weak Characters in the Game](./solutions/1996-the-number-of-weak-characters-in-the-game.js)|Medium|
 2000|[Reverse Prefix of Word](./solutions/2000-reverse-prefix-of-word.js)|Easy|

solutions/1981-minimize-the-difference-between-target-and-chosen-elements.js

@@ -0,0 +1,45 @@
+/**
+ * 1981. Minimize the Difference Between Target and Chosen Elements
+ * https://leetcode.com/problems/minimize-the-difference-between-target-and-chosen-elements/
+ * Difficulty: Medium
+ *
+ * You are given an m x n integer matrix mat and an integer target.
+ *
+ * Choose one integer from each row in the matrix such that the absolute difference between
+ * target and the sum of the chosen elements is minimized.
+ *
+ * Return the minimum absolute difference.
+ *
+ * The absolute difference between two numbers a and b is the absolute value of a - b.
+ */
+
+/**
+ * @param {number[][]} mat
+ * @param {number} target
+ * @return {number}
+ */
+var minimizeTheDifference = function(mat, target) {
+  const m = mat.length;
+  const maxSum = 70 * m;
+  let possibleSums = new Set([0]);
+
+  for (const row of mat) {
+    const nextSums = new Set();
+    for (const num of row) {
+      for (const sum of possibleSums) {
+        const newSum = sum + num;
+        if (newSum <= target + maxSum) {
+          nextSums.add(newSum);
+        }
+      }
+    }
+    possibleSums = nextSums;
+  }
+
+  let result = Infinity;
+  for (const sum of possibleSums) {
+    result = Math.min(result, Math.abs(sum - target));
+  }
+
+  return result;
+};