In a box, there is a jumble of 7 red balls, 6 blue balls, 5 green balls, and 4 yellow balls. What is the minimum number of balls, will you have to pick up so that you have at least 4 balls of the same colour?

What has one letter and starts with an E?

Things are just as they seem, right? Well, check again.
Can you count the number of tigers in this picture ?

A new Engineering building containing 100 offices had just been completed. John was hired to paint the numbers 1 to 100 on the doors. How many times will John have to paint the number nine (9)?

What is the fastest way to double your money?

Cristina leaves home and then she makes exactly 3 left turns and returns home where she found 2 girls wearing the mask.

Who are these two masked girls?

Is the statement valid that it does not matter how much older a sibling is, eventually the younger one will be half as old as the older one?

Evil warlock dislikes dwarfs and therefore he selects four of them and buries them. The dwarfs are buried in the ground and they are in such a way that except for their heads, their body is inside the ground. The dwarfs cannot move their body and they can view only forward. They are all buried in a line, and amongst the four, one of the dwarfs is separated by a wall. All the dwarfs are in the same direction. The last dwarfs can see two heads of friends in the front and a wall. In the last second dwarf can see one head of his friend and a wall. The second dwarf can see only the wall. The dwarf can see nothing.
Warlock comprehends the situation and tells the dwarfs that he has placed hats on their heads. There are two blue hats and two red ones. In all four dwarfs, one of them has to say what colour hat he is wearing. If the dwarf says the correct colour of the hat, they will be left free. If the answer is wrong, then they will be dug inside the ground till the very end.

What will be the answer by the dwarf and how will they answer?

I possess a head

I flaunt a tail

But I don't have mouth or legs

Can you find out who I am?

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?