Available question text
Compute the sum of bitwise XORs of every subset of nums; observe each bit that appears in any element contributes independently and shows up in exactly half of the 2^n subsets, so the answer equals 2^(n-1) times the bitwise OR of all numbers.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1863. Sum of All Subset XOR Totals
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source