2357. Make Array Zero by Subtracting Equal Amounts
You are given a non-negative integer array nums. In one operation, you must: - Choose a positive integer x such that x is less than or equal to the smallest non-zero element in nums. - Subtract x from every positive element in nums. Return the minimum number of operations to make every element in nums equal to 0. Example 1: Input: nums = [1,5,0,3,5] Output: 3 Explanation: In the first opera
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.
Sign in to chat with the tutor and save your progress.
Sign in to start