GoLang Solution For LeetCode Problem: Maximum XOR of Two Numbers in an Array
Solving Maximum XOR of Two Numbers in an Array in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.
Problem Description
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.
See the full details of the problem Maximum XOR of Two Numbers in an Array at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go
Comments
Leave a comment
You are not LoggedIn but you can comment as an anonymous user which requires manual approval. For better experience please Login.