- 🎆 Working @ Lambda
- 💭 You can contact ping me on LinkedIn or contact me at [email protected]
- 🎮 I have fun developing games (taking a break for now) and doing full-stack development
- 🤓 Oh! I almost forget. Here's a link to my dotfiles (I use Arch btw)
- 💘 I am currently focusing on AI integration and full-stack applications (and classical music too)
The XOR total of an array is defined as the bitwise XOR of all its elements, or 0 if the array is empty. Given an array nums, return the sum of all XOR totals for every subset of nums. 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.
class XORSubsetCalculator:
@staticmethod
def subset_xor_sum(nums: List[int]) -> int:
if not nums:
return 0
n = len(nums)
total_sum = 0
for subset_mask in range(1, 1 << n):
xor_total = 0
# Process each bit position
for i in range(n):
if subset_mask & (1 << i):
xor_total ^= nums[i]
total_sum += xor_total
return total_sumNote: Leet Code challenges update once a week😉
