John bought a new car. He has a habit of eating ice cream from a particular ice cream shop while returning home from office. Whenever, he eats strawberry ice cream, he faces no problem. But whenever, he eats chocolate ice cream, the car starts giving problem. At first, he thinks, it is just a co-incidence but when this awkward incident happens for 3-4 times, he reports this problem to the company.

The mechanic of the company checks but finds no problem at all. The next day, when he stops by to eat chocolate ice cream, the car again starts giving problem.

Can you find the possible reason?

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?

A boy collects white seashells from the sea and brings them home every night. When he has enough of them, he decides to sell them to a trader.

The trader is ready to buy the shells and he asks the boy about the quantity. At this, the boy starts calculating. He has a giant box that contains 3 mini boxes. Two of them have another mini box inside. If the giant box can hold 50 shells, how many brown shells can he sell to the trader?

James bond was pushed out of an aeroplane without any parachute.
He survived, How come?

Can you decipher these quotes by Albert Einstein?
Blf xzm mvevi hloev z kilyovn lm gsv ovevo lm dsrxs rg dzh xivzgvw.

A man is lying dead in a field where no one is around. His head is split open and his legs are disfigured. Near to him, there is an unopened package. No living organism can be found anywhere at the crime scene.

How did he die?

The below mentioned letters have been placed in a order using a logic.

DEAD, BALL, FEAR, SHOP

Can you find the logic?

If all Goats are Sheep and all Sheep are Deers, are all Deers Goats ?

Women do it once a year after they turn 19 but men get to do it only once in a lifetime. 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?