# Gray Code: Practice Notes
Gray Code shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
The n-bit Gray code is the (n-1)-bit code followed by that code reversed with the high bit set; equivalently i ^ (i>>1) for i in 0..2^n-1.
## 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(2^n).
## Common mistake
Emitting binary-reflected order incorrectly so adjacent codes differ by more than one bit.
## 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 help for online coding assessments.