Sorry for procrastinating it for too long. ðŸ™‚ ]]>

You can move exactly ONE pebble.

]]>pebbles? There is no constraint mentioned in the problem that this method can’t be the predecided approach.

The binary number method is applicable to one of similar problems

1000 Bottles of wine are there and one of them is poisoned. You have N people to find the poisoned bottles. Basically N will die. Assuming that they will die within 1 hour after drinking. How can you minimize N and what will be the minimum N?

]]>