3514. Number of Unique XOR Triplets II

LeetCodeArrayMathBit ManipulationEnumerationOpen on judge ↗

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: 2 Explanation: The possible XOR triplet values are: - (0, 0, 0) → 1 XOR 1 XOR 1 = 1 - (0, 0, 1) → 1 XOR 1 XOR 3 =

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI