Solution:

20
Just count the nines in the numbers: 6, 16, 26, 36, 46, 56, 76, 86, 96, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69.
Note: 66 contains TWO nines

Solution:

It is best if the person sits on the back of the train. After the stop, the train will be accelerating as it goes into the tunnel. Thus the train will be much master when the back of the train enters the tunnel. In this way, he will have to spend much less time in the tunnel.

Solution:

Zouma is 3 and has two footballs.
Ake is 1 and has one football.
Kalas is 4 and has three footballs.
Aina is 2 and has four footballs.

Solution:

There is a simple logic to solve this question.
The size of the chocolate is 2 x 8. Thus, you need to have 2 x 8 = 16 pieces.
Every time you break the chocolate, you will get one extra piece.
Thus, to get 16 pieces, you must break it (16 - 1) = 15 times.

Solution:

Fifteen Minutes.

After frying for five minutes, you can take out one steak and put the third one inside while turning the other one inside. After five more minutes, one steak is fried from both sides and you can take it out. Now put in the steak that we removed and turn the other one inside. After five more minutes, they both will also be fried from both sides.

Solution:

There are 3 fruits (1 grapes, 1 apples, and 1 oranges).

Solution:

The answer is 'R'

It represents the gear stick. The number 1-5 represents gears and the last one thus should be reverse i.e. R.

Solution:

9 - 8 + 76 - 5 + 4 + 3 + 21 = 100


Other ways of making number 100 (withiout using number 32)
98 + 7 + 6 - 5 - 4 - 3 + 2 - 1 = 100
98 - 7 - 6 - 5 - 4 + 3 + 21 = 100
9 - 8 + 76 - 5 + 4 + 3 + 21 = 100
98 - 7 + 6 + 5 + 4 - 3 - 2 - 1 = 100
98 + 7 - 6 + 5 - 4 + 3 - 2 - 1 = 100
98 + 7 - 6 + 5 - 4 - 3 + 2 + 1 = 100
98 - 7 + 6 + 5 - 4 + 3 - 2 + 1 = 100
98 - 7 + 6 - 5 + 4 + 3 + 2 - 1 = 100
98 + 7 - 6 - 5 + 4 + 3 - 2 + 1 = 100
98 - 7 - 6 + 5 + 4 + 3 + 2 + 1 = 100
9 + 8 + 76 + 5 + 4 - 3 + 2 - 1 = 100
9 + 8 + 76 + 5 - 4 + 3 + 2 + 1 = 100

Solution:

31

Explanation:
Ramanujan lighting the candles in binary.
11110 =30
11111 =31

Solution:

White should move the rook from
A1 to D1 and hence complete the castling move.

Solution:

100

Series of number that do not contain albhabet 'T'