Look at this sequence from top to bottom. What is the next number in the sequence?
1
11
21
1211
111221
312211

What is next number in the pattern below:

131 517 192 123 ?

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?

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?

Can you find the next number in the below sequence
3 , 7 , 10 , 11 , 12 , 17 ?

The doctor advised his patient to take a tablet after every fifteen minutes. He gave him five tablets in total.

How much time will he take to have all the five tablets?

What does man love more than life, and hate more than death or mortal strife; that which satisfied men want; the poor have, and the rich require; the miser spends, the spendthrift saves, and all men carry to their graves?

Two batsman each on 94 runs. Seven runs needed to win in last 3 balls. Both make 100*. How?

Can you name an animal whose killing cannot be performed without spilling your own blood?

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?