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?

Can you find the 09 errors in the picture below?

How many letters are in the alphabet?

Replace all '*' with digits 1, 2, 3, 4, 5 and 6 to make below statement true.

* *
x *
=====
* * *

A man is trapped in a room. The room has only two possible exits doors. Through the first door there is a room constructed from magnifying glass. The blazing hot sun instantly fries anything or anyone that enters. Through the second door there is a fire-breathing dragon. How does the man escape?

John Went to the nearby store in a Mall to buy something for her home. Below is the conversation between the two:

John: How much for the one?
Shopkeeper: It is $2
John: How much for the Eleven?
Shopkeeper: It is $4
John: How much for the Hundred?
Shopkeeper: It is $6.

What is John buying?

A Club organizes a Running Race, and John, Jacob, Minda, and Tony participated.

The results are as follows

John beats Jacob
Minda beats Toni
Toni beats John

Who came first in the race?

There was a strange boy who was born before his father. How can this be possible?

Can you spot the hidden girl in the picture below?

What jumps when it walks and sits when it stands?