Add LeetCode 1863 java, cpp, cs (#86)

Author: Tahanima

Algorithms/Easy/1863_SumOfAllSubsetXorTotals/Solution.cpp

@@ -0,0 +1,19 @@
+class Solution {
+public:
+    int subsetXORSum(vector<int>& nums) {
+        int n = nums.size(), sum = 0;
+        int limit = (1 << n) - 1;
+        
+        for (int mask = 1; mask <= limit; mask++) {
+            int _xor = 0;
+            for (int pos = 0; pos < n; pos++) {
+                if (mask & (1 << pos)) {
+                    _xor ^= nums[pos];
+                }
+            }
+            sum += _xor;
+        }
+        
+        return sum;
+    }
+};

Algorithms/Easy/1863_SumOfAllSubsetXorTotals/Solution.cs

@@ -0,0 +1,18 @@
+public class Solution {
+    public int SubsetXORSum(int[] nums) {
+        int n = nums.Length, sum = 0;
+        int limit = (1 << n) - 1;
+        
+        for (int mask = 1; mask <= limit; mask++) {
+            int _xor = 0;
+            for (int pos = 0; pos < n; pos++) {
+                if ((mask & (1 << pos)) > 0) {
+                    _xor ^= nums[pos];
+                }
+            }
+            sum += _xor;
+        }
+        
+        return sum;
+    }
+}

Algorithms/Easy/1863_SumOfAllSubsetXorTotals/Solution.java

@@ -0,0 +1,18 @@
+class Solution {
+    public int subsetXORSum(int[] nums) {
+        int n = nums.length, sum = 0;
+        int limit = (1 << n) - 1;
+        
+        for (int mask = 1; mask <= limit; mask++) {
+            int _xor = 0;
+            for (int pos = 0; pos < n; pos++) {
+                if ((mask & (1 << pos)) > 0) {
+                    _xor ^= nums[pos];
+                }
+            }
+            sum += _xor;
+        }
+        
+        return sum;
+    }
+}