Leet Code Daily 2024-05-20 - Sum of All Subset XOR Totals

class Solution {
public:
    int dfs(vector<int>& nums, int i, int current_xor) {
        return (i >= nums.size()) ? current_xor
                                  : (dfs(nums, i + 1, current_xor) +
                                     dfs(nums, i + 1, current_xor ^ nums[i]));
    }

    int subsetXORSum(vector<int>& nums) { return dfs(nums, 0, 0); }
};