██████╗ ██████╗ ██████╗ ███████╗ ███████╗███╗ ██╗ █████╗ ████████╗ ██████╗██╗ ██╗██╔════╝██╔═══██╗██╔══██╗██╔════╝ ██╔════╝████╗ ██║██╔══██╗╚══██╔══╝██╔════╝██║ ██║██║ ██║ ██║██║ ██║█████╗ ███████╗██╔██╗ ██║███████║ ██║ ██║ ███████║██║ ██║ ██║██║ ██║██╔══╝ ╚════██║██║╚██╗██║██╔══██║ ██║ ██║ ██╔══██║╚██████╗╚██████╔╝██████╔╝███████╗ ███████║██║ ╚████║██║ ██║ ██║ ╚██████╗██║ ██║ ╚═════╝ ╚═════╝ ╚═════╝ ╚══════╝ ╚══════╝╚═╝ ╚═══╝╚═╝ ╚═╝ ╚═╝ ╚═════╝╚═╝ ╚═╝

Community Problem

Maximum XOR of Two Numbers in an Array

Difficulty: Medium

Find the maximum bitwise XOR of any two elements in an integer array using a bit-trie that's queried greedily from the most significant bit down.

Maximum XOR of Two Numbers in an Array

Find the maximum bitwise XOR of any two elements in an integer array using a bit-trie that's queried greedily from the most significant bit down.

MEDIUM

$6.99

bit-manipulation

trie

arrays

By @meeratorres

March 6, 2026

Updated May 18, 2026

294 views

Rate

Problem statement is locked. Purchase this item to view the full content.

Solution

Starter code, test cases, and solutions are locked.

Purchase this item to access the full workspace.

All Problems