A sea diver is a real show-off. He showed everyone that he can hold his breath underwater for 15 minutes.

I went to the diver and told him that I can be underwater for double the time i.e 30 minutes.
He responded that he will give me 100$ if I would be able to do it. I won 100$.

What did I do?

In the image below, can you find the value of an angle(y)

What is the word or phrase?

Use the digits from 1 up to 9 and make 100.

Follow the rules.
=> Each digit should be used only once.
=> You can only use addition.
=> For making a number, two single digits can be combined (for example, 4 and 2 can be combined to form 42 or 24)
=> A fraction can also be made by combining the two single digits (for example, 4 and 2 can be combined to form 4/2 or 2/4)

Question: how can we do this?

A fresh card pile is taken out of a box (the pile has 54 cards including 2 jokers). One joker is taken out and then the cards are shuffled for a good amount of times. After shuffling, two piles are made by dividing that one pile.



What is the possibility that one of the piles will have a card sequence from A to K in order?

Cristina was born in 1888. She just had her 30th birthday today how did that happen?

You measure my life in hours
I serve you by expiring
I vanish faster when I am thin
and slower when I am thick
The wind is my energy
What am I?

There is an ancient kingdom where every married woman keeps information regarding the fidelity of other men. However, what they don't know is the fidelity of their own husbands. Also, there is an ancient belief that they don't tell each other about the fidelity of their husbands.

On a certain day, the queen of the kingdom declares that she has identified at least one unfaithful man in the kingdom. She allows the wives to identify and gives them authority to kill their husbands if they are unfaithful at midnight.

How will the wives manage it?

You see a mathematical expression in the picture. Can you think of a movie that this expression refers to?

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?