There was a man he lives in a hotel each morning he presses the first floor button each evening if there is a person in the elevator he asks him to press the 10 floor button if there is no one in the elevator he takes the stairs why.

A king sentenced a man to the death sentence for some crime he had committed. Known for his kindness, the king told the culprit that he had a choice to die in a way he decides.

The culprit was clever and said something that saved him from death. What method do you think he must have chosen for his death?

Two prisoners Jack and Jill are locked in a cell.
There is open window approx 40 feet above the ground of the cell.
They are never able to reach there.

Then they plan to escape by a tunnel and they start digging out.
After digging for more than 20 days, Jill comes with the different plan and they escaped.

what was the plan ?

Before the start of the car race, John and Jacob have the same amount of fuel in their car. With this fuel, John can drive for 4 hours while Jacob can drive five hours.
After a time they realize that the amount of fuel left in John's car is 1/4th of the fuel in Jacob's.

For how long they are racing?

Assume the given figure to be a delicious doughnut. Yes, now you can concentrate more on the puzzle. So you have this delicious doughnut in your refrigerator when your friends come knocking at the door. There are eight of them. Now you have to make three cuts in this doughnut so that each one of you nine people can enjoy a piece of it. Neither you nor your friends would mind the size of their piece as long as they are getting it. How will you do it?

Name the three-letter word that can complete the below words?

A) L O _ _ _ E
B) E D U _ _ _ E
C) _ _ _ E R
D) _ _ _ T L E

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.

Nodes are shown below and you need to connect them based on the following rule: Every node can be connected to the number of nodes inside them, i.e. the first node there is a value of 1 which indicates that the first node can connect to exactly one node only.Can you do it?

What brings you down but never up?

If an electric train is travelling south, then which way is the smoke going?