← All problemsSign in

3824. Minimum K to Reduce Array Within Limit

LeetCodeArrayBinary SearchOpen on judge ↗

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. Example 1: Input: nums = [3,7,5] Output: 3 Explan

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start