You’re given an array of integers called nums. Your task is to count how many triplets of indexes (i, j, k) satisfy the condition nums[i] & nums[j] & nums[k] == 0, where & is the bitwise AND operator and 0≤0 \leq0≤ i,,, j,,, k ≤\leq≤ nums.length.
nums
(i, j, k)
nums[i] & nums[j] & nums[k] == 0
&
i
j
k
nums.length
Constraints:
1≤1 \leq1≤ nums.length ≤1000\leq 1000≤1000
...