Not able to apply logic

#1


is this logic correct how can we compare maximum in be them
please alter code in this .

#2

@rastogi.g1998 firstly, you need to apply a nested for loop to generate all the possible pairs between x, and y. And calculate their xor, and select the max possible value. But the brute force approach will give you TLE as it has a time complexity of O(n*n) . The concept of bitmasking can be applied here. Please look for the hint video given in the course for this question, you will be able to understand it.

#3

Thank you understood the approach and logic

#4

@rastogi.g1998 please mark the doubt as resolved.