Skip to content

Practice Number of Unique XOR Triplets II

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

Medium#3514
LeetCode Problem

Number of Unique XOR Triplets II

Problem Statement

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).

Source: Number of Unique XOR Triplets II on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
nums = [1,3]
Output
2

# Example 2

Input
nums = [6,7,8,9]
Output
4

Constraints

1 <= nums.length <= 1500
1 <= nums[i] <= 1500

Related LeetCode Problems

Practice more problems similar to Number of Unique XOR Triplets II.

Review your practice with PhantomCodeAI

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