Skip to content

Practice Bitwise XOR of All Pairings

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

Medium#2425
LeetCode Problem

Bitwise XOR of All Pairings

ArrayBit ManipulationBrainteaser

Problem Statement

You are given two 0-indexed arrays, nums1 and nums2, consisting of non-negative integers. Let there be another array, nums3, which contains the bitwise XOR of all pairings of integers between nums1 and nums2 (every integer in nums1 is paired with every integer in nums2 exactly once). Return the bitwise XOR of all integers in nums3.

Source: Bitwise XOR of All Pairings on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
nums1 = [2,1,3], nums2 = [10,2,5,0]
Output
13

# Example 2

Input
nums1 = [1,2], nums2 = [3,4]
Output
0

Constraints

1 <= nums1.length, nums2.length <= 10^5
0 <= nums1[i], nums2[j] <= 10^9

Related LeetCode Problems

Practice more problems similar to Bitwise XOR of All Pairings.

1 Two Sum Easy4 Median of Two Sorted Arrays Hard11 Container With Most Water Medium14 Longest Common Prefix Easy15 3Sum Medium
← Previous Longest Uploaded PrefixNext → Number of Pairs Satisfying Inequality

Review your practice with PhantomCodeAI

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

Start Free