Jack and Jill were going through a jungle to the city. They encountered a monster who told them they will only be allowed to escape when they solve a puzzle for him. They didn’t have a choice so they agreed. He states the problem like : I have n buckets having 0 fruits in each bucket initially. I will give you n numbers denoting fruits required at nth position But you need to keep two simple rules: Either you can increment fruit count by 1 in each bucket i.e. Incremental Operation Or you can double the fruits in each bucket i.e. Doubling operation. Twist is - you cant decrease the bucket value either by subtraction or by dividing , only you can increment
