John and his team plan to rob a safe. They got just one chance to break the code else the local police will be informed. Below are clues:
A) Exactly one number is perfectly placed: 9 8 1
B) Everything is incorrect: 9 2 4
C) Two numbers are part of the code of the safe but are wrongly placed: 0 9 3
D) One number is part of the code of the safe but is wrongly placed: 1 4 7
E) One number is part of the code of the safe but is wrongly placed: 7 8 3

At a party, there are five people and a whole round cake lying at the centre of the table. Only four people will make a cut and take their piece and the last one will get the remaining piece on the table. How can they make sure that everyone gets a 1/5th of the piece?

One day, I thought of ways that can be used for creating a palindrome. So I decided that I will turn into a larger number by adding the reversed digits to the original number and keep doing it till I finally obtained a palindrome.

I am not sure if this process will always result in a palindrome eventually but I was able to produce a four-digit palindrome. Can you guess my starting number?

You have a thousand Re. 1 coins with you. You have ten bags with you and you can put any number of coins in each of the bags. The condition is that if someone asks you for any amount between 1 and 1000, you must be able to give that amount by just giving the bag (you are not allowed to open the bag and give coins).

How will you do it?

First, think of the colour of clouds. Next think the colour of snow. Last, think of the colour of the moon. Now, what do cows drink?

A man always keeps a spare tyre in his car. To make full use of all the five tyres, he changes the tyres in a manner that for a distance of 1, 00,000 km, each of them runs the same distance.

Can you calculate the distance travelled by each tyre on that journey?

When I asked a girl's name she told me her name is the date '07/09/2001'.

I thought for a few seconds and then I got her name. Do you?

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?

In the picture, you can see a chess board. On the top left position, the K marks a knight. Now, can you move the knight in a manner that after 63 moves, the knight has been placed at all the squares exactly once excluding the starting square?

Can you identify the Oscar-winning movie from the rebus below?