Can you find the missing number in the third row?
35 20 14
27 12 18
5 2 ?

Manish and Manoj play 5 games of chess.
Both Manish and Manoj win the exact same number of games. There is no tie at all.

How?

A large water tank has two inlet pipes (a large one and a small one) and one outlet pipe. It takes 3 hours to fill the tank with the large inlet pipe. On the other hand, it takes 6 hours to fill the tank with the small inlet pipe. The outlet pipe allows the full tank to be emptied in 9 hours.

What fraction of the tank (initially empty) will be filled in 0.64 hours if all three pipes are in operation? Give your answer to two decimal places (e.g., 0.25, 0.5, or 0.75).

Here is a mathematical expression that also secretly tells a movie name. What movie is that?

You along with your friend are standing in front of two houses. Each of those houses inhabits a family with two children.

Your friend tells you the below two facts:
1) On your left is a family that has a boy who likes accounts but the other child loves science.
2) On the right is a family with a seven-year-old boy and a newborn baby.

You ask him, "Does either of the family have a girl?"

To this, he replies, "I am not quite sure. But can you guess that? If you are right, I will give you $500."

Which family do you think is likely to have a girl?

Find the next number in the series?
2, 12, 36, 80, 150, 252, 392, _ ?

Which five letter word can be added at the end of below word to form a
valid word?

> Pin
> Check
> Boiling
> View

What always comes into a house through the keyhole?

Eight Chelsea player makes the following statements :

1. Seven of us are lying here.
2. Six of us are lying here.
3. Five of us are lying here.
4. Five of us are lying here.
5. Four of us are lying here.
6. Three of us are lying here.
7. My name is Torres.
8. My name is Lampard.

The last two are Lampard and Torres or maybe Torres and Lampard.
So can you deduce which of the last two is Lampard or Torres?

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?