A car is crossing a 20 km-long bridge. The bridge can support at most 1500kg of weight over it. If somehow, the weight on the bridge becomes more than that, it will break.

Now, the weight of the car is exactly 1500kg. At the midway, a bird comes and sits on the roof of the car. This bird weighs exactly 200 grams.
Can you tell if the bridge breaks at this point or not?

John and Jill are madly in love with each other. To remind Jill of his pure love, John wants to send her a ring by post but in their country where burglary is quite prominent, any package that is not locked comes under the risk of being stolen for the contents.

John and Jill possess many padlocks but neither one of them has the other key.

Can you find a way John can send the ring to Jill safely?

A pack of cards has 40 cards. You are blindfolded. Out of 40, 25 cards are facing down while 15 are facing up. You have been asked to divide this pack of cards into two decks - so that each deck contains an equal number of face-up cards. Remember, you are blindfolded.

How will you do it?

We know that money can be names differently for the purpose it is used for. Some of the examples of money given at following places or for following activities:

In temple = Daan
In school = Fees
During marriage = Dowry
For divorce = Alimony
Paying government = Tax
In court = Fine
Employer to employee = Salary
To kidnappers = Ransom
For illegal reason = Bribe
To civil servant retirees = Pension

Do you know what do we call the money a husband gives to his wife?

Which letter of the alphabet has the most water?

What can jump higher than a building?

Place a mathematical symbol between the numerals 5 and 9 in such a way that the resulting number is greater than 5 but smaller than 9.

If you were to put a coin into an empty bottle and then insert a cork into the neck, how could you remove the coin without taking out the cork or breaking the bottle?

How can you throw a ball as hard as you can and have it come back to you even if it doesn't hit anything there is nothing attached to it and no one else catches or throws it.

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?