Available question text
Find the maximum bitwise XOR of any two elements (you may pick the same element twice) from nums such that they form a strong pair, i.e., |x − y| ≤ min(x, y). With nums length ≤50 and values ≤100, the strong-pair condition significantly limits candidate pairs so the task reduces to evaluating those pairs and taking the largest XOR.
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 2932. Maximum Strong Pair XOR I
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source