Solution:

2519

The number has to end in 9.
Looked brute force for small numbers.
59 and 119 were promising, but no cigar.

Then looked for agreement among
39 + multiples of 40,
69 + multiples of 70 and
89 + multiples of 90
Smallest one was 2519.

Solution:

3 1 2 2 1 1
1 3 1 1 2 2 2 1

Read Line as one 1 => 1
Read Line 2 as two one => 2 1
Read Line 3 as one two and one one => 1 2 1 1
and so on.

Solution:

I filled a glass full of water and held it over my head for 20 minutes.

Solution:

Since every bacterium divides into two in two minutes and we know the fact that the dish was half filled with bacteria at 3 pm, after exactly 2 minutes, all will divide into two and will fill the petri dish. Thus, the petri dish will become full at 3:02 pm.

Solution:

Solution is shown in image below

Solution:

The wise man told them to switch the horses and then race. In this manner, both of them will be willing to race as fast as they can to prove that the other horse (his own horse) is slow.

Solution:

Move the coins as given in the figure and you will get the required result.

Solution:

The stranger said that he thought the room was his. If so, he must have had the keys to the room and thus he must not have knocked.

Solution:

Here is a way to do it. We dont know if it can be done using some other arrangement or not. If you know, do send us.

4 | 3 | 8
9 | 5 | 1
2 | 7 | 6

Solution:

25 Fruits

Remember we told you that Birbal is a witty trader. So his sole motive is to get rid of the sacks as fast as he can.

For the first sack:
He must be able to fill fruits from one sack to other two sacks. Assume that he is able to do that after M check points. Now to find M,

(Space in first sack) M + (Space in second sack) M = (Remaining fruits in Third Sack) 30 – M
M = 10

Thus after 10 checkpoints, Birbal will be left with only 2 sacks containing 30 fruits each.

Now he must get rid of the second sack.
For that, he must fill the fruits from second sack to the first sack. Assume that he manages to do that after N checkpoints.

(Space in First Sack) N = (Remaining fruits in second sack) 30 – N
N = 15

Thus after he has crossed 25 checkpoints, he will be left be one sack with 30 fruits in it. He has to pass five more checkpoints where he will have to give five fruits and he will be left with twenty five fruits once he has crossed all thirty check points.

Solution:

There is no mention if you can use sign or not and thus the only possible way to get this is as follows:

(15 - 9) + (13 - 7) + (7 - 1) + (9 - 1) + (13 - 9)

If you solve inside the brackets, you will get the following equation
6 + 6 + 6 + 8 + 4
Adding all these numbers, you will get 30 which is the required sum.