A charming young lady was approached by a kind looking old woman in a restaurant. The old woman said to her, 'You look exactly like my younger daughter. Sadly she passed away a couple of months back. Could you do me a favor and say 'Goodbye, mother' with a kind smile on your face when I leave?

The young lady agreed for the same and said, 'Goodbye, mother' when the old woman left. Soon after, she got the most disengaging shock of her life.

Can you guess what the shock was?

I’m tall when I’m young, and I’m short when I’m old. What am I?

A spy was in Canada trying to steal insider information on how to set up new Maple Syrup factories in their country. He was introduced to the operations manager of the biggest factory in Canada. However, the manager was suspicious and decided to test him with a question before he trusted him. So he asked, “What would you be sure to find in the middle of Toronto?” The spy thought fast and came up with an answer for the manager. What was his answer?

I came first on earth but second on the heaven.
I also came twice in a week but found just once in a year.
I stay away from months but you can find me in February.

What am I?

I know a ten-letter word in the English language which can be typed using only the top rows of the computer keyboard.

In a family supper, a grandfather, a grandmother, two fathers, two mothers, four children, three grandchildren, one brother, two sisters, two sons, two daughters, one daughter-in-law, and one mother-in-law need to sit at a table.

There are only seven chairs available at the place. How many more chairs do they have to borrow so that everyone can sit down together for the suppers if everybody requires a separate chair?

How can a man go eight days without sleep?

It's a 7-letter word.
If we remove 1 letter from it, it remains the same.
If we remove 2 letters from it, it remains the same.
If we remove 3 letters from it, it remains the same.
If we remove all the letters from it, still it remains the same.
What is it?

Nodes are shown below and you need to connect them based on the following rule: Every node can be connected to the number of nodes inside them, i.e. the first node there is a value of 1 which indicates that the first node can connect to exactly one node only.Can you do it?

What work can one never finish?