# Minimize XOR: Explained

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

## Key idea

Find x <= n that minimizes x XOR num and has the same popcount as num. Prefer turning on bits where num already has them (they XOR to 0); if extra bits are needed, add the lowest missing bits.

## 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(32).

## Common mistake

Returning n itself without matching popcount, or flipping high bits of num that were already 1.

## 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 job search and interview copilot.