maximum_xor_of_two_numbers_in_an_array

package

v1.2.0 Latest Latest Go to latest Published: May 19, 2019 License: MIT Imports: 0 Imported by: 0

Details

Valid go.mod file

The Go module system was introduced in Go 1.11 and is the official dependency management solution for Go.
Redistributable license

Redistributable licenses place minimal restrictions on how software can be used, modified, and redistributed.
Tagged version

Modules with tagged versions give importers more predictable builds.
Stable version

When a project reaches major version v1 it is considered stable.
Learn more about best practices

< Previous 　　　　　　　　　　　　　　　　 Next >

Given a non-empty array of numbers, a₀, a₁, a₂, … , a_n-1, where 0 ≤ a_i < 2³¹.

Find the maximum result of a_i XOR a_j, where 0 ≤ i, j < n.

Could you do this in O(n) runtime?

Example:

Input: [3, 10, 5, 25, 2, 8]

Output: 28

Explanation: The maximum result is 5 ^ 25 = 28.

There is no documentation for this package.