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?

A couple went on a climbing trip. But only the husband returned from the vacation and said that his wife slipped off while climbing and died. On investigating, the local sheriff arrested him saying, 'Your travel agent called. You murdered your wife.'

The man did not inform anyone about the trip. Then how was the agent so sure that it was a murder?

Consider this about a word: The first two letters signify a male, the first three letters signify a female, the first four letters signify a great, while the entire world signifies a great woman. What is the word?

If you drop me I’m sure to crack, but give me a smile and I’ll always smile back. What am I?

What breaks yet never falls, and what falls yet never breaks?

There is a jar in which there are two types of candies.
20 blueberries and 16 strawberries. You perform the following steps:
1) You take out two candies.
2) If the two candies are of the same flavour, you add a blueberry one otherwise, you add the strawberry one.

You repeat these two steps till there is just one candy remaining in the jar. Which flavoured candy will be left?

I always drive my customer away.

Who am I?

What can you see in the middle of March and April that you can never see in any other month?

Find out which of the given views in the picture is accurately the top view of the given pyramid.

If a shopkeeper can only place the weights on one side of the common balance. For example, if he has weights 1 and 3 then he can measure 1, 3 and 4 only. Now the question is how many minimum weights and names of the weights you will need to measure all weights from 1 to 1000? This is a fairly simple problem and very easy to prove also.