About a few days ago, I read this post, Java Challenge: Dropping Balloons in Java having an interesting question.
It’s a question to find an algorithm that gives the highest floor where you can drop a water balloon without breaking it at a 100 story building. You have only two balloons. I had actually seen this problem before and solved it already. It was not balloons but eggs. The solution is simple. Since if you miss
[...Continue reading Re: Java Challenge: Dropping Balloons in Java...]
Recent Comments