Add solution #2344

Author: JoshCrozier

README.md

@@ -2127,6 +2127,7 @@
 2341|[Maximum Number of Pairs in Array](./solutions/2341-maximum-number-of-pairs-in-array.js)|Easy|
 2342|[Max Sum of a Pair With Equal Sum of Digits](./solutions/2342-max-sum-of-a-pair-with-equal-sum-of-digits.js)|Medium|
 2343|[Query Kth Smallest Trimmed Number](./solutions/2343-query-kth-smallest-trimmed-number.js)|Medium|
+2344|[Minimum Deletions to Make Array Divisible](./solutions/2344-minimum-deletions-to-make-array-divisible.js)|Hard|
 2345|[Finding the Number of Visible Mountains](./solutions/2345-finding-the-number-of-visible-mountains.js)|Medium|
 2347|[Best Poker Hand](./solutions/2347-best-poker-hand.js)|Easy|
 2348|[Number of Zero-Filled Subarrays](./solutions/2348-number-of-zero-filled-subarrays.js)|Medium|

solutions/2344-minimum-deletions-to-make-array-divisible.js

@@ -0,0 +1,35 @@
+/**
+ * 2344. Minimum Deletions to Make Array Divisible
+ * https://leetcode.com/problems/minimum-deletions-to-make-array-divisible/
+ * Difficulty: Hard
+ *
+ * You are given two positive integer arrays nums and numsDivide. You can delete any number
+ * of elements from nums.
+ *
+ * Return the minimum number of deletions such that the smallest element in nums divides
+ * all the elements of numsDivide. If this is not possible, return -1.
+ *
+ * Note that an integer x divides y if y % x == 0.
+ */
+
+/**
+ * @param {number[]} nums
+ * @param {number[]} numsDivide
+ * @return {number}
+ */
+var minOperations = function(nums, numsDivide) {
+  const targetGcd = numsDivide.reduce(gcd);
+  nums.sort((a, b) => a - b);
+
+  for (let i = 0; i < nums.length; i++) {
+    if (targetGcd % nums[i] === 0) {
+      return i;
+    }
+  }
+
+  return -1;
+
+  function gcd(a, b) {
+    return b === 0 ? a : gcd(b, a % b);
+  }
+};