Package g3501_3600.s3513_number_of_unique_xor_triplets_i

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    3513 - Number of Unique XOR Triplets I.

    Medium

    You are given an integer array nums of length n, where nums is a permutation of the numbers in the range [1, n].

    A XOR triplet is defined as the XOR of three elements nums[i] XOR nums[j] XOR nums[k] where i <= j <= k.

    Return the number of unique XOR triplet values from all possible triplets (i, j, k).

    A permutation is a rearrangement of all the elements of a set.

    Example 1:

    Input: nums = 1,2

    Output: 2

    Explanation:

    The possible XOR triplet values are:

    • (0, 0, 0) → 1 XOR 1 XOR 1 = 1

    • (0, 0, 1) → 1 XOR 1 XOR 2 = 2

    • (0, 1, 1) → 1 XOR 2 XOR 2 = 1

    • (1, 1, 1) → 2 XOR 2 XOR 2 = 2

    The unique XOR values are {1, 2}, so the output is 2.

    Example 2:

    Input: nums = 3,1,2

    Output: 4

    Explanation:

    The possible XOR triplet values include:

    • (0, 0, 0) → 3 XOR 3 XOR 3 = 3

    • (0, 0, 1) → 3 XOR 3 XOR 1 = 1

    • (0, 0, 2) → 3 XOR 3 XOR 2 = 2

    • (0, 1, 2) → 3 XOR 1 XOR 2 = 0

    The unique XOR values are {0, 1, 2, 3}, so the output is 4.

    Constraints:

    • <code>1 <= n == nums.length <= 10<sup>5</sup></code>

    • 1 &lt;= nums[i] &lt;= n

    • nums is a permutation of integers from 1 to n.

    • 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 uniqueXorTriplets(IntArray nums)

      • Methods inherited from class java.lang.Object

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