solution.py

class Solution:
    def minimizeArrayValue(self, nums: List[int]) -> int:
        total_sum = 0
        ans = 0
        for i, v in enumerate(nums):
            capacity = ans * (i + 1)
            total_sum += v
            # Can we accomodate last value within current answer 
            if total_sum > capacity:
                # Restribute equally.
                ans = math.ceil(total_sum/(i + 1))
        return ans