Add solution #1863

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,160 LeetCode solutions in JavaScript
+# 1,161 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1020,6 +1020,7 @@
 1817|[Finding the Users Active Minutes](./solutions/1817-finding-the-users-active-minutes.js)|Medium|
 1832|[Check if the Sentence Is Pangram](./solutions/1832-check-if-the-sentence-is-pangram.js)|Easy|
 1833|[Maximum Ice Cream Bars](./solutions/1833-maximum-ice-cream-bars.js)|Medium|
+1863|[Sum of All Subset XOR Totals](./solutions/1863-sum-of-all-subset-xor-totals.js)|Easy|
 1880|[Check if Word Equals Summation of Two Words](./solutions/1880-check-if-word-equals-summation-of-two-words.js)|Easy|
 1886|[Determine Whether Matrix Can Be Obtained By Rotation](./solutions/1886-determine-whether-matrix-can-be-obtained-by-rotation.js)|Easy|
 1910|[Remove All Occurrences of a Substring](./solutions/1910-remove-all-occurrences-of-a-substring.js)|Medium|

solutions/1863-sum-of-all-subset-xor-totals.js

@@ -0,0 +1,36 @@
+/**
+ * 1863. Sum of All Subset XOR Totals
+ * https://leetcode.com/problems/sum-of-all-subset-xor-totals/
+ * Difficulty: Easy
+ *
+ * The XOR total of an array is defined as the bitwise XOR of all its elements, or 0 if
+ * the array is empty.
+ *
+ * For example, the XOR total of the array [2,5,6] is 2 XOR 5 XOR 6 = 1.
+ * Given an array nums, return the sum of all XOR totals for every subset of nums.
+ * Note: Subsets with the same elements should be counted multiple times.
+ *
+ * An array a is a subset of an array b if a can be obtained from b by deleting some (possibly
+ * zero) elements of b.
+ */
+
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var subsetXORSum = function(nums) {
+  const totalSubsets = 1 << nums.length;
+  let result = 0;
+
+  for (let mask = 0; mask < totalSubsets; mask++) {
+    let currentXOR = 0;
+    for (let i = 0; i < nums.length; i++) {
+      if (mask & (1 << i)) {
+        currentXOR ^= nums[i];
+      }
+    }
+    result += currentXOR;
+  }
+
+  return result;
+};