You have an empty wine bottle with a cork that has been secured at the top in a normal way. There is a metal ring inside the bottle that is suspended by a string.

How can you make the metal ring drop to the bottom if you are not allowed to touch anything - not the bottle, not the cork, not the thread and not the ring?

Evil warlock dislikes dwarfs and therefore he selects four of them and buries them. The dwarfs are buried in the ground and they are in such a way that except for their heads, their body is inside the ground. The dwarfs cannot move their body and they can view only forward. They are all buried in a line, and amongst the four, one of the dwarfs is separated by a wall. All the dwarfs are in the same direction. The last dwarfs can see two heads of friends in the front and a wall. In the last second dwarf can see one head of his friend and a wall. The second dwarf can see only the wall. The dwarf can see nothing.
Warlock comprehends the situation and tells the dwarfs that he has placed hats on their heads. There are two blue hats and two red ones. In all four dwarfs, one of them has to say what colour hat he is wearing. If the dwarf says the correct colour of the hat, they will be left free. If the answer is wrong, then they will be dug inside the ground till the very end.

What will be the answer by the dwarf and how will they answer?

I am not a bull but I have horns.
I am not an ass but I have a pack saddle.
Wherever I go, I leave silver behind me.

Who am I?

What has lots of eyes, but can’t see?

If a boy blows 18 bubbles,
Then pops 6 eats 7 and then
He pops 5 and blows 1.
How many are left?

Sherlock Holmes was challenged to make a pre-drawn line smaller without erasing it. He did it in fractions of seconds. How?

How can you make the following equation true by drawing only one straight line: 5+5+5=550 ?

Begin with a word, five letters to my name,
Remove the first and last but I am the same
Take out my middle and still, I remain.
What word am I?

How many letters are in the alphabet?

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?