Can you find the key in the picture below?

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?

Buy me, smell me or deliver me, I do not change.

Who am I?

In an office's desk, you find a unique method that shows the current day of the month. Two numbered cubes are used to depict the current date.

Can you find out the numbers on both the cubes so that each date can be mentioned using them?

Please note that you have to use both the cubes to display any date. Thus the 1st day must be represented by 01 and so on.

The below given figure comprises of a pattern through which you can determine the missing letter. Can you push your mind to find the pattern and add the missing letter?

Here is what you have to do. You have to throw a ball as hard as you can but it must return back to you even if it does not bounce at anything. Also, you have nothing attached to the ball. There is no one on the other end to catch that ball and throw it back at you.

How will you do it?

The Little ant seems to be always confused. Do you know why?

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?

Trying to tease Birbal, Akbar gave him one gold coin and ask him to buy
* something for him to eat
* something for him to drink.
* something to feed the cows
* something to plant in the garden
and most important you need to buy only one thing.

What must Birbal buy to silence Akbar?

In the picture, you can see a chess board. On the top left position, the K marks a knight. Now, can you move the knight in a manner that after 63 moves, the knight has been placed at all the squares exactly once excluding the starting square?