100 floors and 2 eggs.

Again a famous question , similar to ones discussed by Google people and MS people when they are not working.

You stand before a 100-story building with two eggs. Using only these two eggs, you must figure out the highest floor from which you can drop an egg such that the egg won't break when it hits the ground (we'll call this the "highest safe floor"). Every floor is equally likely to be the highest safe floor, including the top floor, and it's also just as likely that the egg will break from every floor. You can assume that if you drop an egg and it doesn't break, its shell is just as strong as it was before you dropped it.

If you want to minimize the expected number of drops you have to perform, what strategy should you use for picking which floors to drop the eggs from?

Apparently , the algorithm of this problem is used in many programming problems.

https://www.crazyengineers.com/commu...zle-for-the-day-egg-puzzle.47676/#post-185422 😛

But it wasn't solved satisfactorily in that thread.

circularsquare

But it wasn't solved satisfactorily in that thread.

Didn't check that. 😳
Members can refer to it. 😛

circularsquare whats the solution

Nice puzzle! Found the solution here:

https://www.programmerinterview.com/index.php/puzzles/2-eggs-100-floors-puzzle/