You are given an integer array nums. A pair of integers (x, y) is called a strong pair if it satisfies the condition $|x - y| \leq \min(x, y)$.

You may choose any two integers from nums to form a strong pair.

Return the maximum bitwise XOR value among all possible strong pairs in nums.

Note: An element can be paired with itself to form a strong pair.

Constraints:

• $1 \leq$ nums.length $\leq 50$

• $1 \leq$ nums[i] $\leq 100$

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.