You walk into a room that contains a match, a kerosene lamp, a candle and a fireplace. What would you light first?

I come in different shapes and sizes.
Parts of me are curved, other parts are straight.
You can put me anywhere you like,
but there is only one right place for me.
What am I?

Twenty frogs are sitting on a log floating on the surface of a river. Two of them decide to jump off into the water.

How many frogs are there on the log at this moment?

Out of three Friends John, Jacob and Jonny one of them is a king, one is a bureaucrat, and one is a Spy.

The king always tells the truth, the bureaucrat always lies, and the Spy can either lie or tell the truth.

John says: Jonny is a bureaucrat
Jacob says: John is a king
Jonny says: I am a Spy

Tell me, Who is the king, who is the bureaucrat, and who is the Spy?

A bus driver was heading down a street in Mexico. He went right past a stop sign without stopping, he turned left where there was a "no left turn" sign, and he went the wrong way on a one-way street. Then he went on the left side of the road past a cop car. Still - he didn't break any traffic laws. Why not?

A car meter reading shows 72927 miles a palindromic number.
what is the minimum number of miles you would need to travel to see another palindromic number on the car meter reading?

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.

I shave every day, but my beard stays the same. What am I?

Only one colour, but not one size,
Stuck at the bottom, yet easily flies.
Present in sun, but not in rain,
Doing no harm, and feeling no pain.
What is 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?