Package g2401_2500.s2425_bitwise_xor_of_all_pairings

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    2425 - Bitwise XOR of All Pairings.

    Medium

    You are given two 0-indexed arrays, nums1 and nums2, consisting of non-negative integers. There exists 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.

    Example 1:

    Input: nums1 = 2,1,3, nums2 = 10,2,5,0

    Output: 13

    Explanation:

    A possible nums3 array is 8,0,7,2,11,3,4,1,9,1,6,3.

    The bitwise XOR of all these numbers is 13, so we return 13.

    Example 2:

    Input: nums1 = 1,2, nums2 = 3,4

    Output: 0

    Explanation:

    All possible pairs of bitwise XORs are nums10 ^ nums20, nums10 ^ nums21, nums11 ^ nums20, and nums11 ^ nums21.

    Thus, one possible nums3 array is 2,5,1,6. 2 ^ 5 ^ 1 ^ 6 = 0, so we return 0.

    Constraints:

    • <code>1 <= nums1.length, nums2.length <= 10<sup>5</sup></code>

    • <code>0 <= nums1i, nums2j<= 10<sup>9</sup></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer xorAllNums(IntArray nums1, IntArray nums2)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait