Add solution #1250

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,196 LeetCode solutions in JavaScript
+# 1,197 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -953,6 +953,7 @@
 1247|[Minimum Swaps to Make Strings Equal](./solutions/1247-minimum-swaps-to-make-strings-equal.js)|Medium|
 1248|[Count Number of Nice Subarrays](./solutions/1248-count-number-of-nice-subarrays.js)|Medium|
 1249|[Minimum Remove to Make Valid Parentheses](./solutions/1249-minimum-remove-to-make-valid-parentheses.js)|Medium|
+1250|[Check If It Is a Good Array](./solutions/1250-check-if-it-is-a-good-array.js)|Hard|
 1252|[Cells with Odd Values in a Matrix](./solutions/1252-cells-with-odd-values-in-a-matrix.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|

solutions/1250-check-if-it-is-a-good-array.js

@@ -0,0 +1,30 @@
+/**
+ * 1250. Check If It Is a Good Array
+ * https://leetcode.com/problems/check-if-it-is-a-good-array/
+ * Difficulty: Hard
+ *
+ * Given an array nums of positive integers. Your task is to select some subset of nums, multiply
+ * each element by an integer and add all these numbers. The array is said to be good if you can
+ * obtain a sum of 1 from the array by any possible subset and multiplicand.
+ *
+ * Return True if the array is good otherwise return False.
+ */
+
+/**
+ * @param {number[]} nums
+ * @return {boolean}
+ */
+var isGoodArray = function(nums) {
+  let gcd = nums[0];
+
+  for (let num of nums) {
+    while (num !== 0) {
+      const temp = gcd % num;
+      gcd = num;
+      num = temp;
+    }
+    if (gcd === 1) return true;
+  }
+
+  return gcd === 1;
+};