Skip to content

Practice Sum of All Subset XOR Totals

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Easy#1863
LeetCode Problem

Sum of All Subset XOR Totals

Problem Statement

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. Note: Subsets with the same elements should be counted multiple times. 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.

Source: Sum of All Subset XOR Totals on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
nums = [1,3]
Output
6

# Example 2

Input
nums = [5,1,6]
Output
28

# Example 3

Input
nums = [3,4,5,6,7,8]
Output
480

Constraints

1 <= nums.length <= 12
1 <= nums[i] <= 20

Related LeetCode Problems

Practice more problems similar to Sum of All Subset XOR Totals.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.