CodingHardcod-g634

Subject Bit manipulationLevel Senior–Staff~35 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

Given an array of non-negative integers (each < 2^30, length 1..100000), find the maximum XOR of any two distinct elements (i != j). Use a binary trie of the bits to achieve O(n * 30) instead of O(n^2). Return the maximum XOR value. If the array has a single element, the answer is 0.

Implement

max_xor_pair(nums: list[int]) → int

Examples

in[[3,10,5,25,2,8]]out28

What a strong answer looks like

State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.

Learn the concepts

Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.

Run or narrate your approach, then ask the coach.