Find the hidden panda in the image below.

What is the fewest number of coins that would be required in order to make sure each and every coin touches exactly three other coins?

Kareena is older than Bipasha. Bipasha is younger than Karishma and younger than Katrina. Katrina is older than Kareena and Alonso, who are older than Karishma.If Alonso and Kareena are twins, who's oldest?

Fate has decided that you will only be pleased to meet me when you need me

Maybe that is why, when I am working, I start working

However annoying I may be to the regulars, the little ones are always inspired

I will always be waiting if you try to reach me

How many of you can guess my name, let me see

A man plots the murder of his wife. His plan is full proof. Nobody saw them leaving their house. He stabbed her with a knife while driving. She died on the spot. He threw her body in a valley. He threw the knife carefully wiping his finger prints on a random garbage bin. Then he went back to his home and no one was watching him this time as well.

After an hour, he was called by the local police department who informed him that his wife was murdered. They asked him to reach the scene of crime immediately. But as soon as he arrived at the crime scene, he was arrested by them.

How did the police know that he himself is the murderer?

Why is 6 afraid of 7?

Prove that the below maths equation is true.

8 + 8 = 91

Two friends decide to get together; so they start riding bikes towards each other. They plan to meet halfway. Each is riding at 6 MPH. They live 36 miles apart. One of them has a pet carrier pigeon and it starts flying the instant the friends start traveling. The pigeon flies back and forth at 18 MPH between the 2 friends until the friends meet.

How many miles does the pigeon travel?

Find the last number in the series below:

voN luJ yaM raM ---

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?