John has eleven friends. He has a bowl containing eleven apples. Now He wants to divide the eleven apples among his friends, in such a way that an apple should remain in his bowl.
How can He do it?

Four people need to cross a rickety bridge at night. Unfortunately, they have only one torch and the bridge is too dangerous to cross without one. The bridge is only strong enough to support two people at a time. Not all people take the same time to cross the bridge. Times for each person: 1 min, 2 mins, 7 mins and 10 mins. What is the shortest time needed for all four of them to cross the bridge?

In the given picture, in how many ways can you read the word "Tiger"?

I have some blue and red sock in my drawer. I have a total of 4 socks. I pick 2 socks and the chance that I get a pair of red socks is 1/2.

What is the chance of picking a pair of blue socks?

What can jump higher than a building?

Before Mount Everest was discovered, what was the highest mountain in the world?

I have a sore throat and a severe headache. I have four tablets with me that are identical to each other and they do not have any cover on them. There is no way I can identify which tablet serves what purpose. The only thing that I know is that two of these four tablets are for the throat and the remaining two are for the headache. To treat my condition, I must take 1 of each. What will I do now?

There was a blind beggar living on the footpath of a street. Suddenly one day, the beggar's brother died. What was the relation of the blind beggar with the person who died?

PS: Brother is not the answer.

On a charity event in Russia, Murray beat Djokovic by winning six games and losing three games.
Note: There is a total of 5 service breaks(one who serve lost the game).
Who served first, Djokovic or Murray?

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?