Hacker News new | past | comments | ask | show | jobs | submit login

I'm curious, what was the trick question given to you by Microsoft Boulder?



I don't recall the exact question, but I recall they were only looking for the answer that used bit manipulation. Which was not necessarily intuitive in the context.


I know a common one is how to switch the values of two variables without using a temporary third variable. One way (method 2 here [1]) is to use repeated bitwise XORs.

Does that sound like it could be the one?

[1] http://www.geeksforgeeks.org/swap-two-numbers-without-using-...


Hm, perhaps counting number of bits set to 1 in a multi-byte array?


no, bit wise is logical there. I'm thinking it was duplicates or primes or some such.




Join us for AI Startup School this June 16-17 in San Francisco!

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: