I had about eight interviews. No kidding.
You are given two eggs and access to a 100-storey building. Both eggs are identical. The aim is to find out the highest floor from which an egg will not break when dropped from a window.
If an egg is dropped and does not break, it is undamaged and can be dropped again. However, once an egg is broken, that egg is lost.
If an egg breaks when dropped from floor n, then it would also have broken from any floor above that. If an egg survives a fall, then it will survive any fall shorter than that.
The question is: What strategy should you adopt to minimize the number of egg drops it takes to find the solution? And what is the worst-case number of drops it will take?
The following metrics were computed from 29 interview experiences for the Goldman Sachs Software Engineer role in London, United Kingdom.
Goldman Sachs's interview process for their Software Engineer roles in London, the United Kingdom is very selective, failing most engineers who go through it.
Candidates reported having good feelings for Goldman Sachs's Software Engineer interview process in London, United Kingdom.