I'm currently reading "How would you move mount Fuji?" which is a book about notorious Microsoft interview questions - some of which are impossible to answer. It was lying around the house, I picked it up and have now got sucked in - you may know how it is.
Many of these questions are in the form of brain teasers, or just difficult problems. A few of the ones I quite enjoyed and I'm happy with my answers on are:
- Why are beer cans tapered at the bottom?
- Why do mirrors reflect right to left?
- Every man in a village of fifty couples has been unfaithful to his wife - TYPICAL MEN. Every woman in the village instantly knows when a man other than her husband has philandered, but not when her own husband has. Local law dictates that a woman who can prove her husband is unfaithful must kill him that very day (firm but fair). One day, the queen, who is known to be infallible (hmmm), visits the village and announces that at least one husband has been unfaithful - what happens?
However, I'm totally stumped on this one (although it may not even HAVE an answer - that's how irritating the book is);
- An evil demon captures a horde of dwarves. He plants a jewel in the forehead of each dwarf which is either red or green. He tells them that he planted an unremovable red or green jewel in the dwarf's forehead but he's not going to tell which colour it is - and as he has also cursed all the dwarves so they can't communicate - nor will anyone else. He also tells them that there is at least one jewel of each colour. One day the demon gets bored of his pet dwarves (fickle) and decides to disposs of them. He let's them know that if all the reds move forward and the greens move back correctly at the regular morning roll call he will let them go - but if even one of them moves incorrectly he'll slaughter the lot (there's no penalty for standing still). Dwarves are known for their ruthless logic - how can they work out the colour of their own jewel without getting everyone killed?