Solution:

If you are thinking to hold one chocolate from each box in hand and then balancing weight in bare hands, you are thinking all wrong.

Let us begin by labelling boxes as 1, 2, 3 and so on till 10.

Now pick one chocolate from box 1, two chocolates from box 2, three from box 3 and so on. In total, you will have 55 chocolates now. (1 + 2 + 3 + ..... + 10)

The ideal weight of the chocolates should be 55 * 20 = 1100. However, somewhere in there are the defected chocolate/s.

You can judge that clearly by noting down the result of 1100 - total weight of chocolates. If the weight is less than 1 gram, the defected box is box 1, if the weight is less than 2 grams, the defected box is box 2 and so on.

Solution:

74658

* 8 + 6 =14
* 5 - 4 = 1
* 7 = 2*4 - 1
* 4 + 6 = 10
* 7+4+6+5+8 = 30

Solution:

4

No Of circles in the number.

Solution:

30,450 miles.

Explanation:
For each 5 miles driven using this rotation, each tire will lose (2/29000)+(2/21000) of its tread.So, suppose we drive 5*N miles like this. Then, each tire will lose 2*N*((1/29000)+(1/21000)) of its tread. We wish to determine N so that the latter expression gets to be 1, representing all of each tire's tread. That happens when N=6090, which is when 5*N (the total miles driven) is 30,450.

Solution:

TIF56

Explanation:
The password is formed as:
T (5th letter of Shruti)
I (5th letter of Arshika)
F(1st letter of Friday)
5(5th day of week)
6(Length of Friday)

Similarly, we will pick the 1st letter for Monday and 3rd letter for Wednesday.

Solution:

Solution is below

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:

The Bangladeshi seaman is the thief. This is because the Japanese flag cannot be identified as upside down as it is the same both ways. Thus he is just trying to escape the situation.

Solution:

If you take a look closely, you will acknowledge the fact that every symbol in the given figure is somehow associated with the surrounding one’s position. The upside-down spade is used to the left of a right-side-up heart every time.

Solution:

The node can be connected as shown.

Solution:

'five'

Its the count of alphabet