Suppose the solution is k, that is, we can find the floor always within k drops. For our first drop, we could try a floor as high as floor k. This is because if the egg breaks, we can try all the floors below floor k and still determine the floor within k drops.
After dropping an egg on floor k and not broken, we now have k-1 remaining drops. Since our solution is k, we can now move up to floor k + (k-1). This still satisfies the total k drops criteria.
Then, if this doesn't work out, we can move up to floor k + (k-1) + (k-2), and so on so forth.
So, eventually we can move up as high as floor
k + (k-1) + (k-2) + (k-3) + ... + 1 = k(k+1)/2
The highest floor should be 99. Thus, we have:
k(k+1)/2 >= 99, from this, we get k=14
So, the answer is 14 maximum drops and we can find the floor.