Add solution #1497

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,329 LeetCode solutions in JavaScript
+# 1,330 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1144,6 +1144,7 @@
 1493|[Longest Subarray of 1's After Deleting One Element](./solutions/1493-longest-subarray-of-1s-after-deleting-one-element.js)|Medium|
 1494|[Parallel Courses II](./solutions/1494-parallel-courses-ii.js)|Hard|
 1496|[Path Crossing](./solutions/1496-path-crossing.js)|Easy|
+1497|[Check If Array Pairs Are Divisible by k](./solutions/1497-check-if-array-pairs-are-divisible-by-k.js)|Medium|
 1502|[Can Make Arithmetic Progression From Sequence](./solutions/1502-can-make-arithmetic-progression-from-sequence.js)|Easy|
 1507|[Reformat Date](./solutions/1507-reformat-date.js)|Easy|
 1512|[Number of Good Pairs](./solutions/1512-number-of-good-pairs.js)|Easy|

solutions/1497-check-if-array-pairs-are-divisible-by-k.js

@@ -0,0 +1,36 @@
+/**
+ * 1497. Check If Array Pairs Are Divisible by k
+ * https://leetcode.com/problems/check-if-array-pairs-are-divisible-by-k/
+ * Difficulty: Medium
+ *
+ * Given an array of integers arr of even length n and an integer k.
+ *
+ * We want to divide the array into exactly n / 2 pairs such that the sum of each pair is
+ * divisible by k.
+ *
+ * Return true If you can find a way to do that or false otherwise.
+ */
+
+/**
+ * @param {number[]} arr
+ * @param {number} k
+ * @return {boolean}
+ */
+var canArrange = function(arr, k) {
+  const remainders = new Array(k).fill(0);
+
+  for (const num of arr) {
+    const remainder = ((num % k) + k) % k;
+    remainders[remainder]++;
+  }
+
+  for (let i = 0; i <= Math.floor(k / 2); i++) {
+    if (i === 0 || i * 2 === k) {
+      if (remainders[i] % 2 !== 0) return false;
+    } else if (remainders[i] !== remainders[k - i]) {
+      return false;
+    }
+  }
+
+  return true;
+};