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 absent-minded ancient philosopher forgot to wind up his only clock in the house. He had no radio, TV, telephone, internet, or any other means for telling time. So he travelled on foot to his friend's place a few miles down the straight desert road. He stayed at his friend's house for the night and when he came back home, he knew how to set his clock. How did he know?

What is both possible and impossible at the same time?

In the given figure, move three matchsticks so that the resulting figure contains two rectangles.

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?

I am a type of word that is spelt incorrectly or used differently, on purpose for humour. What am I?
Hint 1: You can find me in a joke.
Hint 2: I am a play on words.

You walk into an old horror house. It has no power or plumbing. Once inside, you see three doors. Each door has a number on it. Behind each door is a way for you to die. Behind door number one, you die by getting eaten by a lion. Behind door number two, you die by getting murdered. Behind door number three, you die by an electric chair. You can’t turn back, so you have to go through a door. Which door do you go through?

A famous swimmer can swim downstream in a lake in exactly 40 minutes with the lake current.
He can swim upstream in that lake in exactly 60 minutes against the lake current.
The length of the lake is 2 km.

How long he can cover the distance of one side at a still lake with no current?

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 a basket of apples,
when counted in twos, there was one extra
when counted in threes, there were two extra when counted in fours, there were three extra
when counted in fives, there were four extra
when counted in sixes, there was five extra.

However, if the apples were counted in sevens, no extra apple was left. Can you calculate the minimum number of apples that were present in the basket?