Sum of All Subset XOR Totals | Leetcode 1863

class Solution {
public:
    int subsetXORSum(vector<int>& nums) {
        int n = nums.size();
        int orr = 0;
        for(int ele: nums)
            orr |= ele;
        return orr * (1<<(n-1));
    }
};
/*
//JAVA
import java.util.List;

class Solution {
    public int subsetXORSum(int[] nums) {
        int n = nums.length;
        int orr = 0;
        for (int ele : nums) {
            orr |= ele;
        }
        return orr * (1 << (n - 1));
    }
}

#Python
from typing import List

class Solution:
    def subsetXORSum(self, nums: List[int]) -> int:
        n = len(nums)
        orr = 0
        for ele in nums:
            orr |= ele
        return orr * (1 << (n - 1))

*/