Number of Unique XOR Triplets II - Practice Coding | SlaveCode
0
0123456789
0
0123456789
:
0
0123456789
0
0123456789
3514. Number of Unique XOR Triplets II
Medium
30 Points
Array
Math
Bit Manipulation
Enumeration
You are given an integer array nums.
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).
Examples
Example 1
Input: nums = [1,3]
Output: 2
Explanation:
The possible XOR triplet values are:
The unique XOR values are {1, 3} . Thus, the output is 2.
Example 2
Input: nums = [6,7,8,9]
Output: 4
Explanation:
The possible XOR triplet values are {6, 7, 8, 9} . Thus, the output is 4.
Constraints
1 <= nums.length <= 1500
1 <= nums[i] <= 1500
3514. Number of Unique XOR Triplets II
Medium
30 Points
Array
Math
Bit Manipulation
Enumeration
You are given an integer array nums.
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).
Examples
Example 1
Input: nums = [1,3]
Output: 2
Explanation:
The possible XOR triplet values are:
The unique XOR values are {1, 3} . Thus, the output is 2.
Example 2
Input: nums = [6,7,8,9]
Output: 4
Explanation:
The possible XOR triplet values are {6, 7, 8, 9} . Thus, the output is 4.