Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3514. Number of Unique XOR Triplets II
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source