Leetcode 2932. Maximum Strong Pair XOR I

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.