Solution:

The man is dead and not mute.

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:

Yes, you should switch the envelope. In the beginning when you picked up the envelope, you had a 1/3 probability of finding an offer letter in the envelope. There was 2/3 chance that the letter was there in the two envelopes on the table.

If you keep your selected envelope, you still have a 1/3 chance of finding an offer letter in that. However, since the interviewer has removed one empty envelope from the table, if you switch, you have a probability of 2/3 that the offer letter is inside that.

Solution:

At 01:05

Solution:

See the colored sticks in the picture. We have moved those sticks in the position given in the second image corresponding with the color.

Solution:

The check was for dollars 31.63.

The bank teller gave her dollars 63.31
She spent .05, and then she had dollars 63.26, which is twice the check.

Let x be the dollars of the check, and y be the cent.

The check was for 100x + y cent
He was given 100y + x cent

Also
100y + x - 5 = 2(100x + y)
Expanding this out and rearranging, we find:
98y = 199x + 5

or 199x ≡ -5 (mod 98)
or 98*2*x + 3x ≡ -5 (mod 98)
3x ≡ -5 ≡ 93 (mod 98)
this quickly leads to x = 31

Solution:

73

Explanation:
It's a very famous puzzle known as "Josephus Problem Puzzle". It can be solved in various ways but the trick to solve this problem is illustrated below.

Binay number of 100 is: 1100100
complement pf 100 is 0011011, whose decimal equivalent is 27.
The desired answer will be 100 - 27 = 73

Solution:

There are two things to keep in mind:
Firstly there is at least one red hat. (There can be two or three as well).
Secondly the competition is fair for everyone.

Thus if there is only one red hat, that person will see two green hats on other heads and will be able to deduce his own color as red. However the other students will see one red and one green hat and can never be sure. In such manner, the competition will prove to be partial for one student.

Suppose if there are two red hats. Then the students who are wearing red hats will see one red and one green hat on others. Now they must have deduced that there can’t be just one red hat. Thus they will know that they are also wearing a red hat. But the one who is wearing a green hat will see two red hats and can never be sure of his own color. In this case as well, the competition will not be fair.

Thus the only possible and fair means is if all of them are wearing a red hat. The one who is able to deduce the situation first, will raise his hand and will tell the correct answer.

Solution:

On the back, since bullet train is accelerating, therefore,the person at the back will spend less time than one in front.

Solution:

There are six unique answers

Ans1:
7 x 4 = 28
36 / 4 = 9
1 + 4 = 5

Ans2:
9 x 4 = 36
28 / 4 = 7
1 + 4 = 5

Ans3:
3 x 8 = 24
56 / 8 = 7
1 + 8 = 9

Ans4:
7 x 8 = 56
24 / 8 = 3
1 + 8 = 9

Ans5:
4 x 8 = 32
56 / 8 = 7
1 + 8 = 9

Ans6:
7 x 8 = 56
32 / 8 = 4
1 + 8 = 9

Solution:

I spoke with Joe.

Explanation:
There can be only two cases. Either Zoe is a liar or Joe is a liar.

First Case
Let us assume that Zoe is a liar and Joe is a truthful person.
If I asked the question from Joe, the answer will be yes. If I asked the question from Zoe, the answer will be no. Thus in this case, I must have asked from Joe.

Second Case
Let us assume that Zoe is a truthful and Joe is a liar.
If I asked the question from Joe, the answer will be yes. If I asked the question from Zoe, the answer will be no. Thus in this case as well, I must have asked from Joe only.