How much will a 38° angle measure when looked at under a microscope that magnifies ten times?

You walk into an old horror house. It has no power or plumbing. Once inside, you see three doors. Each door has a number on it. Behind each door is a way for you to die. Behind door number one, you die by getting eaten by a lion. Behind door number two, you die by getting murdered. Behind door number three, you die by an electric chair. You can’t turn back, so you have to go through a door. Which door do you go through?

Look at the picture and find out which square is not linked with any of the other squares.

What can run but never walk, have a mouth that never speaks, have a head that never weeps, and have a bed but never sleeps?

I am first found in caves, now prolific online; I am a depiction, a drawing, a symbol, or sign. I will convey whichever mood you could wish; or for that matter, a fist, flask, or fish. What am I?

No one wants to have it, but if one got it, he does not want to lose it. What is It?

The great emperor Akbar once ruled India. He was well known for his intelligence. But along with that, he was known for the Nine Gems in his court. One of the nine gems was Birbal, a quick witted and extremely intelligent man. The stories of his wit were widely popular.

Once a king ruling in a distant land heard of Birbal. To check his wit, he sent an invitation and called him to visit his land. Akbar allowed Birbal to go and he took off on the journey.

Upon reaching that kings kingdom, he was welcomed with flowers. He was then escorted to the palace of the king. Upon entering the palace, Birbal found that there were six people sitting in front of him adorning the same robe. They were also lookalike and it was hard to judge who the real king was.

After a couple of minutes, Birbal approached one of them and bowed in front of him greeting him.

That was the real king. How did Birbal know who was the real king ?

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?

The following alphametic has only one solution. Can you find it?
ENLIST + SILENT + LISTEN = ANAGRAM

PS: You may start the number from 0.

Count the squares in the matchstick puzzle below?