Piles Of Boxes

Asked at BNP Paribas · Coding Questions · Difficulty: Medium

Alex is given `n` piles of boxes of equal or unequal heights. In one step, Alex can remove any number of boxes from the pile which has the maximum height and try to make it equal to the one which is just lower than the maximum height of the stack. Determine the minimum number of steps required to make all of the piles equal in height.

Loading the problem…