Solution: Sum of All Subset XOR Totals
Solution: Sum of All Subset XOR Totals asks you to sum XOR totals for every subset of an integer array, counting the empty subset and duplicate-index subsets separately.
We'll cover the following...
We'll cover the following...
Statement
Given an array of integers, nums, compute and return the sum of XOR totals for all its possible subsets.
A subset is any combination of elements from the original array,
nums. This includes the empty subset (containing no elements) and the subset that includes all array elements.The XOR total of a subset results from applying the XOR operation to all the elements in that subset.
Note: If the
numsarray has duplicate elements, then ...