← All problemsSign in

Fill the Bucket

In a row of buckets, every bucket has a unique capacity. You can order the buckets in any order you want. Initially, all the buckets are empty in a row. Now, you do the following steps repeatedly, until all the buckets are filled: Take the front bucket of the row, fill it, and take it out of the row. If there are still buckets in the row, put the next top bucket of the row at the end of the row. I

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start