Available question text
Generate any sequence of 2^n distinct integers in [0, 2^n-1] starting at 0 such that consecutive numbers (and the first and last) differ by exactly one bit—equivalently, produce a Hamiltonian cycle/traversal of the n-dimensional hypercube. Constraint: 1 ≤ n ≤ 16 (output length 2^n).
Related questions
Continue with questions that share topics or the same question type.
- Advent of Code Day 7 Variation
Coding
- Coding test: Given a simple mockup implement that UI. Some CSS is already provided and an API to fetch the data also exists. The recruiter prep doc talked about structuring the code well, making sure all functions work, write CSS and write tests. There is no way you can do it all in 1 hour, so it's probably best to ask the interviewer what they expect
Coding
- Coupon Code Validator
Coding
- for the technical phone screen both questions were leetcode tagged. You can not run your code on coderpad. You have to dry run your solution.
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 89. Gray Code
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source