A lion and its tamer are standing inside a cage that measures 1 unit in radius. Both of them can effortlessly run at the speed of 1 unit maximum.

1) Suppose the lion is hungry, will he be able to eat up the tamer?
2) If yes, how long can the tamer survive?

Can you make a six-letter word using the letters N, A and B ?

You along with your friend are standing in front of two houses. Each of those houses inhabits a family with two children.

Your friend tells you the below two facts:
1) On your left is a family that has a boy who likes accounts but the other child loves science.
2) On the right is a family with a seven-year-old boy and a newborn baby.

You ask him, "Does either of the family have a girl?"

To this, he replies, "I am not quite sure. But can you guess that? If you are right, I will give you $500."

Which family do you think is likely to have a girl?

1 + 9 + 8 = ?
considering, 28 + 8 + 92 = 10

Yesterday I fell from 30 feet high ladder but I don't get hurt. Why?

What demands an answer, but asks no questions

A prisoner is told: "If you tell a lie, we will hang you and if you tell the truth, we will shoot you." What did the prisoner say to save himself?

Mr. Buttons was all set to go to the village of Buttonland to meet his friend. So, he packed his bags and left for the village at 5 in the morning. Upon travelling on a road for miles, he came across a point where the road diverged into two. He was confused on which road to take. He gazed around and he saw two owls sitting on a branch. He thought he could ask for directions for the village from the two owls. So he went to the tree. There he saw a sign which read, "One owl always lies, and one is always truthful. They both fly away if you ask them more than 1 question."
Mr. Buttons was caught in the dilemma of what to ask? And from which owl to ask, since he only had one question. What should Mr. Buttons ask?

I cry without having a voice.
I fly without having wings.
I bite without having teeth.
I whisper without a mouth.

Who am I?

In the picture, you can see a chess board. On the top left position, the K marks a knight. Now, can you move the knight in a manner that after 63 moves, the knight has been placed at all the squares exactly once excluding the starting square?