Leetcode-Solutions/scripts/algorithms/M/Maximum XOR of Two Numbers in an Array at main · AnasImloul/Leetcode-Solutions

Name		Name	Last commit message	Last commit date
parent directory ..
Maximum XOR of Two Numbers in an Array.cpp		Maximum XOR of Two Numbers in an Array.cpp
Maximum XOR of Two Numbers in an Array.java		Maximum XOR of Two Numbers in an Array.java
Maximum XOR of Two Numbers in an Array.js		Maximum XOR of Two Numbers in an Array.js
Maximum XOR of Two Numbers in an Array.py		Maximum XOR of Two Numbers in an Array.py
README.md		README.md
info.json		info.json

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: