Maximum Strong Pair XOR I

Given an integer array nums, find the maximum XOR value of any two elements that form a strong pair. Two numbers x and y form a strong pair if |x - y| <= min(x, y). If no strong pair exists, return 0.

Examples
Input: []
Output: 0

Maximum Strong Pair XOR I

Given an integer array `nums`, find the maximum XOR value of any two elements that form a strong pair. Two numbers `x` and `y` form a strong pair if `|x - y| <= min(x, y)`. If no strong pair exists, return 0.