John is pretty weird. He likes toffees but hates chocolates. He loves books but never reads. He likes to build his troops in an online game but does not proceed with the war. He likes to go swimming but is afraid of water.

Seeking this behaviour, can you tell whether he likes balloons and parties?

A girl was sitting in her hotel room when she heard a knock on the door. She opened the door and found that a man was standing outside.
The man said, "Oh! I am really sorry, I thought this was my room."
He then walked through the corridor to the elevator. The girl did not know the man. She closed her door and called security asking them to apprehend the man.
What made her suspicious of that man? He might have been genuinely mistaken.

Which is heavier: a ton of bricks or a ton of feathers?

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.

Can you solve the below tricky visual equation?

Rob is taller than Edwin, and Jurgen is shorter than Rob.
Of only one of the following statements, we now certainly know it is correct:

A.Edwin is taller than Jurgen
B.Jurgen is taller than Edwin
C.It cannot be determined if Jurgen or Edwin is the tallest.

If two fifty-foot ropes are suspended from a forty-foot ceiling that is twenty feet apart, how much rope will you be able to steal if you have a knife?

In a fruit store, there was a unique weighing machine that was made to weigh only cherries and strawberries as they were priced the same.

Other fruits like watermelons or mango had different machines as they were expensive.

A man successfully buys watermelons at the price of cherries. How?

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?

I have an apple tree , number of apple in this tree get doubles every week.

On 30th week , the tree gets completely filled with apples :-)



Can you tell me , on what week does my tree is half covered with apples ?