Solution:

When the boats meet for the first time, they have sailed a combined distance that is equal to one length of the lake. When they meet the second time, they have sailed 3 lengths. The elapsed time and the distance for each is three times.

When they meet for the second time, the boat M has sailed 500 x 3 = 1500 yards. Now, this is 300 yards longer than the length of the lake, it must be 1200 yards wide.

The ration between the speed of boat M and boat N is equal to the ratio of the distance that they have sailed before they meet the first time.

Solution:

One Night Stand.

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

Solution:

This can be done if you draw a five pointed star and place the balls on the corners and intersection points. See the figure to understand better.

Solution:

To do this, he must be pushing the cork inside the bottle and then taking out the coin.

Solution:

The Stars

Solution:

The bridge won't break.

When the car has travelled half of the bridge, that is 15km, the car must have used more than 300 grams of fuel. Therefore, the impact of bird's added weight will be zero literally.

Solution:

One of the cop will move clockwise while the other will move anti-clockwise every day. In such a manner, they will catch the thief in minimum seven days.

Solution:

The girl was born on 29 February. Thus her birthday came once in four years only while her sister was born on a normal day and celebrated her birthday every year. Thus the girl had a chance of depositing money only 10 times in 4 years through which she collected $2500 while her sister took $50 from the piggy bank every year making the total amount to be $2000. Thus when the piggy bank was opened, it had just $500.

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:

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:

13 numbers

Explanation:
Since we are looking to find odd reminder which implies that the remainder will be either 1 or 3
Therefore number must follow below two conditions:
A) We can list number 5n + 1 or 5n + 3. (where n = 0,1,2,3.....)
B) The number must end in 1 or 3.

List of such numbers less than 100 are:
1, 3, 11, 13, 21, 23, 31, 33, 41, 43, 51, 53, 61, 63, 71, 73, 81, 83, 91, 93

Let's remove the nonprime ones which are 1, 21, 33, 51, 63, 81 and 91

So, I will be left with 13 numbers which fit the bill.
3, 11, 13, 23, 31, 41, 43, 53, 61, 71, 73, 83 and 93