Search
⌘K
Get Premium
Leetcode 3514. Number of Unique XOR Triplets II
Count the number of distinct values obtainable as nums[i] XOR nums[j] XOR nums[k] over all triplets with i <= j <= k. With n up to 1500, you must exploit XOR properties or combinatorics to avoid brute-force O(n^3) enumeration.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.