CodingHardcod-g181

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

Question

Given an array nums of non-negative integers (each fits in 32 bits, up to 1000 elements), choose any subset (possibly empty) and XOR its elements together. Return the maximum XOR value achievable over all subsets. The empty subset gives 0. For example, from [3, 8, 12] the best is 3 XOR 12 = 15.

Implement

max_xor_subset(nums: list[int]) → int

Examples

in[[3,8,12]]out15

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.