It has five wheels, though often think four, You cannot use it without that one more, You can put things in it, you can strap things on top, You can't find it in the market, but you can still go shop. What is it?

You have two buckets of 11 liters and 6 litres.
How can you measure exactly 8 litres?

Mr Black, Mr Gray, and Mr White are fighting in a truel. They each get a gun and take turns shooting at each other until only one person is left. Mr Black, who hits his shot 1/3 of the time, gets to shoot first. Mr Gray, who hits his shot 2/3 of the time, gets to shoot next, assuming he is still alive. Mr White, who hits his shot all the time, shoots next, assuming he is also alive. The cycle repeats. If you are Mr Black, where should you shoot first for the highest chance of survival?

John is a strange liar.

He lies on six days of the week, but on the seventh day, he always tells the truth.

He made the following statements on three successive days:

Day 1: "I lie on Monday and Tuesday."
Day 2: "Today, it"s Thursday, Saturday, or Sunday."
Day 3: "I lie on Wednesday and Friday."

On which day does John tell the truth?

How many people must be gathered together in a room, before you can be certain that there is a greater than 50/50 chance that at least two of them have the same birthday?

I have lakes with no water, mountains with no stone and cities with no buildings. What am I?

If you read clockwise, you can form a word by inserting three missing letters in the picture given below. Can you do it?

Two prisoners Jack and Jill are locked in a cell.
There is open window approx 40 feet above the ground of the cell.
They are never able to reach there.

Then they plan to escape by a tunnel and they start digging out.
After digging for more than 20 days, Jill comes with the different plan and they escaped.

what was the plan ?

A seven-year-old kid challenged his classmates that he can make the number one disappear by adding something to it.

How can he do that?

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?