3513. Number of Unique XOR Triplets I

Given an array nums of length n — a permutation of [1, n]. A XOR triplet is nums[i] XOR nums[j] XOR nums[k] for i ≤ j ≤ k (indices may coincide). Return the count of distinct values over all such…