Warehouse Allocation (Distribute)

Problem Overview

• Given n piles of boxes, you may move one box from pile i to pile j (i ≠ j) if pile i has at least one.
• Task: find the minimum number of moves to achieve the smallest possible difference d between the largest and smallest pile.
• Input: array boxes of size n; Output: minimum operations; Constraints: 1 ≤ n ≤ 1e5, 1 ≤ boxes[i] ≤ 1e9.
• Real-world context: warehouse logistics and fair distribution of goods.
• An Amazon interviews coding interview problem and common interview question.