Three friends named Mr. Black, Mr. Yellow and Mr. Green enter a pub on a weekend night. They are wearing either a Black, Yellow or Green shirt.
Mr. Yellow says to them, 'Did you notice that we all are wearing different color shirts than our names?'
To this, the man who was wearing the Green shirt said. 'Wow, thats right.'
Can you identify who is wearing which colour shirt ?
A B C D E F G H
These are the letters given to you. Now you have to find out the letter that comes two to the right of the letter which is immediately to the left of the letter that comes three to the right of the letter that comes midway between the letter two to the left of the letter C and the letter immediately to the right of the letter F.
100 prisoners are stuck in the prison in solitary cells. The warden of the prison got bored one day and offered them a challenge. He will put one prisoner per day, selected at random (a prisoner can be selected more than once), into a special room with a light bulb and a switch which controls the bulb. No other prisoners can see or control the light bulb. The prisoner in the special room can either turn on the bulb, turn off the bulb or do nothing. On any day, the prisoners can stop this process and say "Every prisoner has been in the special room at least once". If that happens to be true, all the prisoners will be set free. If it is false, then all the prisoners will be executed. The prisoners are given some time to discuss and figure out a solution. How do they ensure they all go free?
Two friends were stuck in a cottage. They had nothing to do and thus they started playing cards. Suddenly the power went off and Friend 1 inverted the position of 15 cards in the normal deck of 52 cards and shuffled it. Now he asked Friend 2 to divide the cards into two piles (need not be equal) with equal number of cards facing up. The room was quite dark and Friend 2 could not see the cards. He thinks for a while and then divides the cards in two piles.
On checking, the count of cards facing up is same in both the piles. How could Friend 2 have done it ?
You have four chains. Each chain has three links in it. Although it is difficult to cut the links, you wish to make a single loop with all 12 links. What is the fewest number of cuts you must make to accomplish this task?
There is a cryptic organization called Cicada 3301 that posts challenging puzzles online, possibly to recruit codebreakers and linguists.