Add solution #2206

Author: JoshCrozier

README.md

@@ -823,6 +823,7 @@
 2154|[Keep Multiplying Found Values by Two](./2154-keep-multiplying-found-values-by-two.js)|Easy|
 2161|[Partition Array According to Given Pivot](./2161-partition-array-according-to-given-pivot.js)|Medium|
 2185|[Counting Words With a Given Prefix](./2185-counting-words-with-a-given-prefix.js)|Easy|
+2206|[Divide Array Into Equal Pairs](./2206-divide-array-into-equal-pairs.js)|Easy|
 2215|[Find the Difference of Two Arrays](./2215-find-the-difference-of-two-arrays.js)|Easy|
 2226|[Maximum Candies Allocated to K Children](./2226-maximum-candies-allocated-to-k-children.js)|Medium|
 2235|[Add Two Integers](./2235-add-two-integers.js)|Easy|

solutions/2206-divide-array-into-equal-pairs.js

@@ -0,0 +1,36 @@
+/**
+ * 2206. Divide Array Into Equal Pairs
+ * https://leetcode.com/problems/divide-array-into-equal-pairs/
+ * Difficulty: Easy
+ *
+ * You are given an integer array nums consisting of 2 * n integers.
+ *
+ * You need to divide nums into n pairs such that:
+ * - Each element belongs to exactly one pair.
+ * - The elements present in a pair are equal.
+ *
+ * Return true if nums can be divided into n pairs, otherwise return false.
+ */
+
+/**
+ * @param {number[]} nums
+ * @return {boolean}
+ */
+/**
+ * @param {number[]} nums
+ * @return {boolean}
+ */
+var divideArray = function(nums) {
+  const map = new Map();
+
+  for (const num of nums) {
+    map.set(num, (map.get(num) || 0) + 1);
+  }
+  for (const count of map.values()) {
+    if (count % 2 !== 0) {
+      return false;
+    }
+  }
+
+  return true;
+};