You are given two stones, and access to a 100-storey building. Bothstones are identical. The aim is to find out the highest floor from which a stone will not break when dropped out of a window from that floor. If a stone is dropped and does not break, it is undamaged and can be dropped again. However, once a stone is broken, thats it for that stone.
If a stone breaks when dropped from floor n, then it would also have broken from any floor above that. If an stone survives a fall, then it will survive any fall shorter than that.
How many minimum tries do you need to find from which floor the stone will start breaking?
1. 50
2. 25
3. 32
4. 15
5. 14
got it right, but still would like to know the ideas from others.![]()
If a stone breaks when dropped from floor n, then it would also have broken from any floor above that. If an stone survives a fall, then it will survive any fall shorter than that.
How many minimum tries do you need to find from which floor the stone will start breaking?
1. 50
2. 25
3. 32
4. 15
5. 14
got it right, but still would like to know the ideas from others.