Number of Unique XOR Triplets II
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).
Example 1
Input
nums = [1,3]Output
2The unique XOR values from all possible triplets are {1, 3}, so the output is 2.
Example 2
Input
nums = [6,7,8,9]Output
4The possible XOR triplet values are {6, 7, 8, 9}, so the output is 4.
Constraints
- 1 <= nums.length <= 1500
- 1 <= nums[i] <= 1500