An Algorithmic CamelLogic Level 3
You have to cross a large desert covering a total distance of 1,000 km between Point A and Point B. You have a camel and 3,000 bananas. The camel can carry a maximum of 1,000 bananas at any time.
The camel eats the bananas at a constant rate of one banana per kilometer travelled. What is the maximum number of uneaten bananas (rounded off to the closest whole number) that the camel can transport to the other end of the desert?
On the face of it, it seems that you can’t transport even a single banana uneaten to the other end of the desert. However, if that would have been the case, I wouldn’t have posted it and wasted your time.
Hint: You have to make multiple trips back and forth as you transfer all 3000 bananas. Find the most efficient way.