class Solution:
def minimizeArrayValue(self, nums: List[int]) -> int:
return max(ceil(n / (i + 1)) for i, n in enumerate(accumulate(nums)))
leetcode
challenge
Here is the link for the problem:
https://leetcode.com/problems/minimize-maximum-of-array/
Top comments (0)