A bridge is about to collapse. There are four people P, Q, R and S on one of the sides. Before the bridge collapses, they want to cross it. Now since the bridge is too weak, it can only stand the weight of two people at a time. Also, it is night time and nothing is visible. They have just one torch with them.

Now P takes one minute to cross the bridge, Q takes two minutes to cross, R takes five minutes to cross and S takes ten minutes to cross.

The bridge will collapse in seventeen minutes. How will they be able to cross the bridge before it collapses?

Once upon a time, there was a castle on a square island. The entire island was surrounded by a 14m wide trench. The Romans had wanted to invade the castle and had brought a few wooden planks along with them to facilitate themselves in crossing the moat. The planks were however found to be only 13m long.

The Romans still managed to cross the trench. How did they do it?

A boy was at a carnival and went to a booth where a man said to the boy, "If I write your exact weight on this piece of paper then you have to give me $50, but if I cannot, I will pay you $50." The boy looked around and saw no scale so he agrees, thinking no matter what the carny writes he'll just say he weighs more or less. In the end the boy ended up paying the man $50. How did the man win the bet?

Today is John's birthday.
A year ago, John had five candles and he lit all the candles except the one at the last.
Now he is going to light all the candles.

How old is John Today?

(He is not five today.....)

My thunder comes before the lightning; my lightning comes before clouds; my rain dries all the land it touches. What am I?

What's a single-digit number with no value?

Can you count the number of triangles in the given picture?

Can you find the company name in the pictogram below?

The chance of Mr John winning the lottery is 10%. All participants lined up and Mr John is 4th in the row. The first three participants lose the lottery.

What is the chance of Mr John now?

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?