Skip to content

Instantly share code, notes, and snippets.

@latortuga

latortuga/interview question

Created October 28, 2010 16:05
Show Gist options
  • Save latortuga/651685 to your computer and use it in GitHub Desktop.
Save latortuga/651685 to your computer and use it in GitHub Desktop.
Download ZIP
An interesting interview question
Raw
interview question
Given a set of numbers from 0 to 2^n-1, with one missing, how would you find the missing number in one pass through the set and using at most n bits of extra storage
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment