![]() |
technical riddles You have an empty room, and a group of people waiting outside the room. At each step, you may either get one person into the room, or get one out. Can you make subsequent steps, so that every possible combination of people is achieved exactly once?
kms
It's pretty straightforward if you've heard of a Gray code.
Ham Fisted
That's the problem with these riddles... they're all pretty straight forward if you know the answer. Personally, I think these are terrible questions to ask a serious candidate.
Dave
|