Solution:

Suppose if there is just one unfaithful husband, then his wife will kill her husband as she must be knowing that all other men are faithful but the queen declared that one of them all is unfaithful.

If there are two unfaithful husbands, then both their wives will believe there is just one unfaithful husband, that too the other one whom she knows. Thus both of them will expect the above case to happen at midnight. But when no one is shot, they will realize that there are two unfaithful husbands and since they know about everyone, they will know that the other unfaithful man is their own husband on the next day.

If there are three unfaithful husbands, each of their wives will be knowing about two other unfaithful men so they will be expecting the above case and will be waiting for the gunshots on the second day. When that does not happens, they will realize that there are more than two and since they all will know about the rest, they will realize that their own husband is unfaithful and they will kill him on the third day.

Thus if we talk about general terms and suppose that there are n unfaithful husbands, their wives will believe that there is n-1 unfaithful husbands and will expect the gunshot on n-1 day. When they don’t hear that, they will realize their own husband is the nth.

Solution:

Yes, some people are going get really tiny pieces but you were allowed for that right. Also, there is another way of doing it. Can you think of it?

Solution:

Step one: First you will have to make 3 trips of 1,000 apples 333 miles. Then you will be left with 2,001 apples and 667 miles to go.

Step two: Next you will have to take 2 trips of 1,000 apples 500 miles. In this manner you will be left with 1,000 apples and 167 miles to go (you have to leave an apple behind).

Step three: At last, you will have to travel the last 167 miles with one load of 1,000 apples and you will be left with 833 apples when you reach the town

Solution:

2 minutes (duration between 9:59 and 10:01)

Solution:

17 mins

The initial solution most people will think of is to use the fastest person as an usher to guide everyone across. How long would that take? 10 + 1 + 7 + 1 + 2 = 21 mins. Is that it? No. That would make this question too simple even as a warm up question.

Let’s brainstorm a little further. To reduce the amount of time, we should find a way for 10 and 7 to go together. If they cross together, then we need one of them to come back to get the others. That would not be ideal. How do we get around that? Maybe we can have 1 waiting on the other side to bring the torch back. Ahaa, we are getting closer. The fastest way to get 1 across and be back is to use 2 to usher 1 across. So let’s put all this together.

1 and 2 go cross
2 comes back
7 and 10 go across
1 comes back
1 and 2 go across (done)

Total time = 2 + 2 + 10 + 1 + 2 = 17 mins

Solution:

One Night Stand.

Explanation:
Number 'One' + Knight(chess piece) + st + and(symbol &)

Solution:

If you ask the guard who always tells the truth, he would tell you the other guard would point you to the door of death. If you ask the guard who always lies, he would tell you the opposite door of the truth-telling guard and point you to the door of death. In either case, both guards will point to the door of death so you should choose the other one.

Solution:

Tilt the barrel until the fruit juice barely touches the lip of the barrel. If the bottom of the barrel is visible then it is less than half full.If the barrel bottom is still completely covered by the fruit juice, then it is more than half full.

Solution:

17 min

The initial solution most people will think of is to use the fastest person as an usher to guide everyone across. How long would that take? 10 + 1 + 7 + 1 + 2 = 21 minutes. Is that it? No. That would make this question too simple even as a warm up question.

Let's brainstorm a little further. To reduce the amount of time, we should find a way for 10 and 7 to go together. If they cross together, then we need one of them to come back to get the others. That would not be ideal. How do we get around that? Maybe we can have 1 waiting on the other side to bring the torch back. Ahaa, we are getting closer. The fastest way to get 1 across and be back is to use 2 to usher 1 across. So let's put all this together.

1 and 2 go cross
2 comes back
7 and 10 go across
1 comes back
1 and 2 go across (done)

Total time = 2 + 2 + 10 + 1 + 2 = 17 minutes

Solution:

He simply suggested that one of the brothers will be allowed to divide the land but he must take into consideration that it will be the other one who will have a choice of selecting his land between the two halves first.

Thus both will be happy in such manner.

Solution:

888 + 88 + 8 + 8 + 8 = 1000