Available question text
Given an integer array nums, compute the xor-beauty defined as the XOR of ((nums[i] | nums[j]) & nums[k]) over all ordered triplets (i, j, k). With n up to 1e5, a brute-force O(n^3) is infeasible — the challenge is to exploit bitwise independence/parity to reduce the computation to linear-time aggregation of bit contributions.
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 2527. Find Xor-Beauty of Array
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source