Available question text
Compute the bitwise XOR of all pairwise XORs nums1[i] ^ nums2[j] for every i, j; use XOR's associativity and cancellation so the result depends only on the XOR of an array when the other array's length is odd, giving an O(n+m) solution suitable for large inputs.
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 2425. Bitwise XOR of All Pairings
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source