#3824

Minimum K to Reduce Array Within Limit

medium · 41.1% accepted · 61 likes · top 21%

array · binary search

⊣ practice⊣ open on leetcode ↗

Description

You are given a positive integer array nums.

For a positive integer k, define nonPositive(nums, k) as the minimum number of operations needed to make every element of nums non-positive. In one operation, you can choose an index i and reduce nums[i] by k.

Return an integer denoting the minimum value of k such that nonPositive(nums, k) <= k2.

Solution