How many times in a given day, minutes and hour clock comes in a straight line ?

The day after tomorrow will be three days before Tuesday. Can you find out what is today?

What brings you down but never up?

You board a train. The train will have to enter a tunnel soon. You are claustrophobic. Which place is the best for you to sit?

You are a thief and you are being punished for your crime. People have tied your head down on a tree with a rope that has been anchored in the ground. A candle is burning below the rope which is slowly burning it away. Just below your head, a Lion has been left loose and is waiting for you to drop down on the ground so he can have you as his lunch.

You have to survive the scenario. How will you do it?

Two friends decide to get together; so they start riding bikes towards each other. They plan to meet halfway. Each is riding at 6 MPH. They live 36 miles apart. One of them has a pet carrier pigeon and it starts flying the instant the friends start traveling. The pigeon flies back and forth at 18 MPH between the 2 friends until the friends meet.

How many miles does the pigeon travel?

One night, a man runs away from home. He turns left and keeps running. After some time he turns left again and keeps running. Later, he turns left one more time and runs back home—but when he gets home, he finds a man in a mask. Who was the man in the mask?

A man was convicted of a minor offence in Akbar court. Akbar decided to give him a chance. He asked him to give a statement. If the statement is true, he will be killed by lions and if it is false, he will be killed by trampling of wild elephants.

The convicted person requested help from Birbal and since the crime was not a big one, Birbal decided to help him. Whatever Birbal suggested impressed Kabir and he let the convicted person go.

What did Birbal suggest to the person?

What can run but never walks, has a mouth but never talks, has a head but never weeps, has a bed but never sleeps?

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?