Add solution #1296

Author: JoshCrozier

README.md

@@ -116,6 +116,7 @@
 1291|[Sequential Digits](./1291-sequential-digits.js)|Medium|
 1292|[Maximum Side Length of a Square with Sum Less than or Equal to Threshold](./1292-maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold.js)|Medium|
 1295|[Find Numbers with Even Number of Digits](./1295-find-numbers-with-even-number-of-digits.js)|Easy|
+1296|[Divide Array in Sets of K Consecutive Numbers](./1296-divide-array-in-sets-of-k-consecutive-numbers.js)|Medium|
 1297|[Maximum Number of Occurrences of a Substring](./1297-maximum-number-of-occurrences-of-a-substring.js)|Medium|
 1304|[Find N Unique Integers Sum up to Zero](./1304-find-n-unique-integers-sum-up-to-zero.js)|Easy|
 1309|[Decrypt String from Alphabet to Integer Mapping](./1309-decrypt-string-from-alphabet-to-integer-mapping.js)|Easy|

solutions/1296-divide-array-in-sets-of-k-consecutive-numbers.js

@@ -0,0 +1,40 @@
+/**
+ * 1296. Divide Array in Sets of K Consecutive Numbers
+ * https://leetcode.com/problems/divide-array-in-sets-of-k-consecutive-numbers/
+ * Difficulty: Medium
+ *
+ * Given an array of integers nums and a positive integer k, find whether it is
+ * possible to divide this array into sets of k consecutive numbers.
+ *
+ * Return true if it is possible. Otherwise, return false.
+ */
+
+/**
+ * @param {number[]} nums
+ * @param {number} k
+ * @return {boolean}
+ */
+var isPossibleDivide = function(nums, k) {
+  if (nums.length % k) {
+    return false;
+  }
+
+  const map = {};
+  const set = new Set(nums);
+  nums.forEach(x => map[x] ? map[x]++ : map[x] = 1);
+
+  let count = nums.length / k;
+  while (count--) {
+    let min = Math.min(...set);
+    for (let i = min; i < min + k; i++) {
+      if (!map[i]) {
+        return false;
+      }
+      if (!--map[i]) {
+        set.delete(i);
+      }
+    }
+  }
+
+  return true;
+};