# XOR Linear Basis Gaussian: Walkthrough

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

## Key idea

Insert numbers from high bit to low, reducing by existing basis vectors so each bit has at most one representative; query max XOR by greedy.

## 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(b) per insert or query for b-bit numbers, O(b) basis size.

## Common mistake

Inserting a reduced value into a bit that is already occupied instead of walking down.

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