Solution:

==Solution 1==
Pamela is Michael's daughter. This is because Michael is Shelly's son. Also he is married to one of the Joseph's daughters. Joseph's other daughter is married to Harry and Danny is their son.

==Solution 2==
Michael and Harry are brothers. Shelly is their mother. In this case, 'Harry's wife's sister's husband's mother's son' refers to Harry himself. Thus, Danny is Michale's son and Pamela is Harry's daughter which means that Pamela is Michael's niece.

Solution:

119

Explanation:
Let the minimum number of chocolates = C
When divided by 2, remainder = 1
When divided by 3, remainder = 2
When divided by 4, remainder = 3
When divided by 5, remainder = 4
When divided by 6, remainder = 5
When divided by 7, remainder = 0

Therefore, C is divisible by 7.

Whenever C is divided by any number less than 7, the remainder is 1 less than the divisor.
This implies that, C + 1 is the LCM of 2, 3, 4, 5 and 6.

Now LCM of 2, 3, 4, 5 and 6 = 60
But 60 - 1 = 59 is not divisible by 7

60 * 2 = 120
120 - 1 = 119 which is divisible by 7

Therefore, C + 1 = 120 or C = 119

Number of minimum number of chocolates in the box = 119

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:

The three errors are as follows:
a) fynd is spelled wrong. The correct spelling is 'find'.
b) that is not appropriate to use here. It should be 'this'.
c) There are only two errors in the question and that is the third error because the questions asks us to find three.

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:

Now there can be two solutions to the given situation because there can be two situations:
Suppose if B and C have same colors, A will know that his color is the other one and he will be able to speak up the first.
Now if B and C do not have same colors, A will stay silent. This will tell B that his and C's colors are different. Thus he will speak up first.

So either A or B will speak up first depending on the situation.

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.

Solution:

Rhea will open just one present.
Cindy|Y - Y is the 25th alphabet
Duk|E - E is the 5th alphabet
Joh|N - N is the fifteenth alphabet
Rhe|A - A is the first alphabet

Solution:

The person on 73rd number will survive.

Explanation:
Till the number is the power of 2, the last person to survive will be the one who started it. But since the number here is not the power of 2, we will take the greatest power of 2 that is less than the number which is 64.
100 - 64 = 36
36 people are killed as 2, 4, 6, ..., 72. Thus the sword will now be given to the 73rd person. Now he is the first person to start in the remaining 64 people. Thus he will be the one to survive.

Solution:

Upon reaching each room, he found out that the window facing the dead body was closed. He had to open the window himself. This tells that there was somebody else with him who closed the window. If he would have committed suicide, at least one window would have been open.