Maximum XOR subset
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]) → intExamples
in
[[3,8,12]]out15What 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.
0:00 of about 35 min
solution.py
InputExpectedGot
[[3,8,12]]15not run yetsample