# Maximum XOR After Operations: Practice Notes

Maximum XOR After Operations shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

You may turn off any subset of bits of a single number but cannot turn a bit on. The maximum XOR you can reach is the bitwise OR of the whole array.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n).

## Common mistake

Returning the XOR of the original array, or thinking a missing bit can be created.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at AI assistant for technical interviews.