playground/leetcode/0421-maximum-xor-of-two-numbers-in-an-array at main · MuhtasimTanmoy/playground

Name		Name	Last commit message	Last commit date
parent directory ..
0421-maximum-xor-of-two-numbers-in-an-array.cpp		0421-maximum-xor-of-two-numbers-in-an-array.cpp
NOTES.md		NOTES.md
README.md		README.md

README.md

Given an integer array nums, return the maximum result of nums[i] XOR nums[j], where 0 <= i <= j < n.

Example 1:

Input: nums = [3,10,5,25,2,8]
Output: 28
Explanation: The maximum result is 5 XOR 25 = 28.

Example 2:

Input: nums = [14,70,53,83,49,91,36,80,92,51,66,70]
Output: 127

Constraints: