Given a $0$ indexed integer array nums.

The effective value of a triplet of indices (i, j, k) is calculated as ((nums[i] | nums[j]) & nums[k]).

The XOR beauty of the array is defined as the bitwise XOR sum of the effective values of all possible index triplets (i, j, k) satisfying $0 \leq$ i, j, k $<$ nums.length.

Return the XOR beauty of nums.

Constraints:

• $1 \leq$ nums.length $\leq 10^5$

• $1 \leq$ nums[i] $\leq 10^9$

Input: nums = [7]-List[int]
Output: 7-int
Explanation: The only triplet uses the value 7 for all three indices, producing an effective value of 7, so the XOR beauty is 7.

Input: nums = [2,8,32]-List[int]
Output: 42-int
Explanation: Evaluating the effective value for every possible index triplet and XORing all results produces 42.

Input: nums = [3,12,48,5]-List[int]
Output: 58-int
Explanation: Evaluating the effective value for every possible index triplet and XORing all results produces 58.

Input: nums = [9,9,9,9]-List[int]
Output: 0-int
Explanation: Every triplet has an effective value of 9, and the XOR of all 64 identical results is 0.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.