There is so small cabin inside a deep forest.
All the forest burned out to worst possible but the inside of the cabin is still the same.
However all the person inside the cabin die.

How come ?

How many bananas can you eat if your stomach is empty?

Solve the following series:
AZ, GT, MN, __, YB

Steffi's daughter Jazelle needs to be picked up from school every day.
Steffi asks one of her colleagues to pick up Jazelle from the school. Steffi devised a password system to confirm that Jazelle goes with the correct colleague only.

The password on Monday was SJM16.
The password on Wednesday was TAW39.

What will the password be for Friday?

What 5-letter word typed in all capital letters can be read the same upside down?

A family is trapped in a jungle. There is a bridge which can lead them to safety. But at one time, the bridge can only allow two people to pass through. Also, all of them are afraid of the dark and thus, they can't go alone.

Father takes 1 minute to cross, the mother takes 2 minutes, the son takes 4 and the daughter takes 5 minutes. While crossing the time taken will be according to the slower one. How can they all reach the other side in the minimum possible time?

1 rabbit saw 9 elephants while going to the river. Every elephant saw 3 monkeys going toward the river. Each monkey had 1 parrot in each hand. How many animals are going towards the river?

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?

Three cars are driving on a track that forms a perfect circle and is wide enough that multiple cars can pass anytime. The car that is leading in the race right now is driving at 55 MPH and the car that is trailing at the last is going at 45 MPH. The car that is in the middle is somewhere between these two speeds.
Right now, you can assume that there is a distance of x miles between the leading car and the middle car and x miles between the middle car and the last car and also, x is not equal to 0 or 1.
The cars maintain their speed till the leading car catches up with the last car and then every car stops. In this scenario, do you think of any point when the distance between any two pairs will again be x miles i.e. the pairs will be x distance apart at the same time ?

What is the next number in the series?

15 29 56 108 208 ?