Add solution #416

Author: JoshCrozier

README.md

@@ -281,6 +281,7 @@
 412|[Fizz Buzz](./0412-fizz-buzz.js)|Easy|
 414|[Third Maximum Number](./0414-third-maximum-number.js)|Easy|
 415|[Add Strings](./0415-add-strings.js)|Easy|
+416|[Partition Equal Subset Sum](./0416-partition-equal-subset-sum.js)|Medium|
 419|[Battleships in a Board](./0419-battleships-in-a-board.js)|Medium|
 434|[Number of Segments in a String](./0434-number-of-segments-in-a-string.js)|Easy|
 435|[Non-overlapping Intervals](./0435-non-overlapping-intervals.js)|Medium|

solutions/0416-partition-equal-subset-sum.js

@@ -0,0 +1,34 @@
+/**
+ * 416. Partition Equal Subset Sum
+ * https://leetcode.com/problems/partition-equal-subset-sum/
+ * Difficulty: Medium
+ *
+ * Given an integer array nums, return true if you can partition the array into two subsets
+ * such that the sum of the elements in both subsets is equal or false otherwise.
+ */
+
+/**
+ * @param {number[]} nums
+ * @return {boolean}
+ */
+var canPartition = function(nums) {
+  const sum = nums.reduce((a, b) => a + b);
+  if (sum % 2) {
+    return false;
+  }
+
+  const target = sum / 2;
+  let set = new Set([0]);
+  for (const n of nums) {
+    const next = new Set(set);
+    for (const value of set) {
+      if (value + n === target) {
+        return true;
+      }
+      next.add(value + n);
+    }
+    set = next;
+  }
+
+  return false;
+};