One day, all the courtiers from Akbar's court were gathered in the assembly hall when one of them told the Emperor that all his valuables had been stolen by a thief the previous night.
This shocked the Emperor to his core as the place where that courter stayed was the most secured in the kingdom. The Emperor thought that it is not at all possible for an outsider to enter into the courtier's house and steal the valuables. Only another courtier could commit this crime. He quickly called Birbal to identify the thief.
Birbal thought for a while and successfully solved the mystery by identifying the thief in just one statement.
What did Birbal say?

Sherlock Holmes was challenged to make a pre-drawn line smaller without erasing it. He did it in fractions of seconds. How?

I get hot but I never sweat,
I cook food but I am not a chef,
I have a door but you can't enter me,
I have a light but I am not a lamp.
Who am I?

They do not possess flesh or feathers or scales or bone
But still, they are blessed with fingers and thumbs of their own.

I have two coins.
* One of the coins is a faulty coin having a tail on both sides of it.
* The other coin is a perfect coin (heads on side and tail on other).

I blindfold myself and pick a coin and put the coin on the table. The face of the coin towards the sky is the tail.

What is the probability that another side is also tail?

A man was gazing through the window of the 23rd floor of the building. He suddenly opened the window and jumped on the other side of the window. On landing on the floor, there was not a sheer mark of injury on him.

How can that be possible if he did not use any kind of parachute and did not land on a soft surface?

If a shopkeeper can only place the weights on one side of the common balance. For example, if he has weights 1 and 3 then he can measure 1, 3 and 4 only. Now the question is how many minimum weights and names of the weights you will need to measure all weights from 1 to 1000? This is a fairly simple problem and very easy to prove also.

Find the Next Number in the Sequence

2 9 3 1 8 4 3 6 5 7 ?

In which direction should the missing arrow point?

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?