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?

A large container is kept in open under the rain. Every passing hour, the water collected inside the container becomes double what it was.

In ten hours, the container is filled completely. Can you calculate how long would it have taken to be filled in half?

The Judge knows that Alamgir was killed by his girlfriend Jasline, but the judge is unsure whether to punish her. Why?

An ape is trying to climb on a pole that is 60 feet high. Due to the slippery surface, the ape climbs 3 feet in a minute only to slip back 2 feet.

How much time do you think the monkey will take to reach the top of the pole?

Replace the question mark with the correct number.

A farmer went to a market and bought a wolf, a goat, and a cabbage. On his way home, the farmer came to the bank of a river and rented a boat. But crossing the river by boat, the farmer could carry only himself and a single one of his purchases: the wolf, the goat, or the cabbage. If left unattended together, the wolf would eat the goat, or the goat would eat the cabbage. The farmer’s challenge was to carry himself and his purchases to the far bank of the river, leaving each purchase intact. How did he do it?

There was a competition where the contestants had to hold something. At the end of the event, the winner was a person who had no hands or feet. What was it that the contestants had to hold?

Three doctors said that Bill was their brother. Bill says he has no brothers. How many brothers does Bill actually have?

I have thought of a number that is made up by using all the ten digits just once. Here are a few clues for you to guess my number:

First digits is divisible by 1.
First two digits are divisible by 2.
First three digits are divisible by 3.
First four digits are divisible by 4.
First five digits are divisible by 5.
First six digits are divisible by 6.
First seven digits are divisible by 7.
First eight digits are divisible by 8.
First nine digits are divisible by 9.
The number is divisible by 10.

Can you find out the number ?

You have four chains. Each chain has three links in it. Although it is difficult to cut the links, you wish to make a single loop with all 12 links. What is the fewest number of cuts you must make to accomplish this task?