Solution:

Let us first assume that the number of drops required are N.

If the egg breaks at maximum number of tries, we will have N - 1 drops till it does not break. Thus we must drop the first egg from the height N. Now if the first drop of the first egg does not break the egg, we can have N - 2 drops for the second egg if the first egg breaks in the second drop.

Let us put that into a valid example for better understanding. Suppose we need 16 drops. Now let us drop the egg from the sixteenth floor, if it breaks, we will try all the floors below sixteen. Suppose it does not breaks, then we have 15 drops left and we will drop it from 16+15+1 = 32nd floor. This is because if it breaks at 32nd floor, we can try all the way down to 17th floor in fourteen tries making the total tries to be 16.

Let us assume that 16 is the correct answer

1 + 15 16 if breaks at 16 checks from 1 to 15 in 15 drops
1 + 14 31 if breaks at 31 checks from 17 to 30 in 14 drops
1 + 13 45.....
1 + 12 58
1 + 11 70
1 + 10 81
1 + 9 91
1 + 8 100 we can easily do in the end as we have enough drops to complete the task.

Seeking the above case, we must note that we have achieved it in 14 or 14 drops but we still need to find out the optimal one. We know from above that the optimal one will require 0 linear trials in the last step.

Thus we can say that

(1+p) + (1+ (p-1)) + (1+ (p-2)) + .........+ (1+0) >= 100.

Let 1+p=q which is the answer we are looking for

q (q+1)/2 >=100

q=14

Thus the optimal number of drops required are 14.

Drops will be tried at floor number 14, 27, 39, 50, 60, 69, 77, 84, 90, 95, 99, 100. How? Just move up 14, 13, 12 .... Floor till it breaks or does not.

Solution:

This one definitely sounds too unusual. But there is an easy way to look at things.

Let us say that there is one unfaithful husband in the town. In such a case, 99 women will know about him. The wife of that man will be the only one who will not know about him and would have always thought that his husband is truly faithful to her. But since the mayor announced that there is at least one cheater among them, she will come to a realization that her husband must be cheating on her. So her husband will be executed on the first day of the announcement.

Now let us take up a case that there are two cheating husbands in the town. Now 98 women of the town must be knowing about them both. The two wives of those men will think that there is only one cheater in the town. Both of them believes that their respective husbands are loyal and this would not report about them

But when both of them will find out on the next day that no one was executed, they will realize that it could only mean that both of their husbands are cheaters. Thus both the husbands will be executed on the second day.

Thus if we have X number of cheating husbands, they all will die on the Xth day after the announcement is being made.

Solution:

This is quite a common interview question.
Let us begin counting.

There are 61 1x1 squares
39 2x2 squares
20 3x3 squares
5 4x4 squares

Thus the total number of squares = 61 + 39 + 20 + 5 = 125

Solution:

Let us assume that the average age ten years ago was x
Now total age back then = 6x

The father died today so the number of members = 5

Thus total age after 10 years = 5(x + 10)

A baby was also born today but since he is 0 years old, the total age will be 5(x + 10) only

Now considering the question, the total age is same
i.e. 6x = 5(x + 10)
6x = 5x + 50
x = 50

Which means that the age 10 years back was 50 years.
Thus his father died at 50 + 10 = 60 years.

Solution:

Well this question is quite easy but still many people jump up to the conclusion so quickly and in the wrong direction. Just focus on the line that it doubles in size every day. Since the lotus has covered the entire pond in 20 days, it must have grown to half of the pond on the previous day i.e. the 19th day.

Thus the lotus will take 19 days to cover half the pond.