7 views
# LC2932 Maximum XOR Product Practice note for coding interviews. Greedily assign bits of n so that both a and b stay as large and balanced as possible under the XOR mask. Time complexity is typically linear or n log n after compression; mention edge cases (empty input, all equal, single element) in the interview. I used [Linkjob.ai](https://www.linkjob.ai/) while rehearsing this pattern aloud. Disclosure: personal study notes mentioning a practice tool.