human
Maximum XOR of Two Numbers in an Array | Function to return the maximum xor.
set the i 'th bit in mask  like 100000, 110000, 111000...
Just keep the prefix till i ' th ▁ bit ▁ neglecting ▁ all ▁ ▁ the ▁ bit ' s after i 'th bit.
find two pair in set such that a ^ b = newMaxx which is the highest possible bit can be obtained.
clear the set for next iteration.
Driver Code"
Solution in Python:

=====
Write me a code to maximum XOR of Two Numbers in an Array and the other steps required?
assistant
#Here is code to maximum XOR of Two Numbers in an Array and the other steps required.
 def max_xor ( arr , n ) :
	maxx = 0
	mask = 0 ;
	se = set ( )
	for i in range ( 30 , - 1 , - 1 ) :
		mask |= ( 1 << i )
		newMaxx = maxx | ( 1 << i )
		for i in range ( n ) :
			se . add ( arr [ i ] & mask )
		for prefix in se :
			if ( newMaxx ^ prefix ) in se :
				maxx = newMaxx
				break
		se . clear ( )
	return maxx
arr = [ 25 , 10 , 2 , 8 , 5 , 3 ]
n = len ( arr )
print ( max_xor ( arr , n ) )