Gray code sequence
Return an n-bit Gray code sequence: a list of the 2^n integers 0..2^n-1 arranged so that consecutive values (and the first and last) differ in exactly one bit, starting at 0. Return the standard reflected Gray code order. 0 <= n <= 12.
Implement
gray_code(n: int) → list[int]Examples
in
[2]out[0,1,3,2]What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 20 min
solution.py
InputExpectedGot
[2][0,1,3,2]not run yetsample