# Single Number III: Interview Notes

Single Number III shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

XOR the whole array to get a^b; isolate a distinguishing bit of that XOR and partition the numbers into two groups, then XOR each group to recover a and b.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (bitmasks, backtracking with pruning, or interval DP) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n) extra O(1).

## Common mistake

Trying to find both uniques with a single XOR, which only yields their mix.

## 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 linkjob.ai.