Make Array Zero by Subtracting Equal Amounts
In this lab, you'll be working on an algorithm problem where you are given a non-negative integer array
nums. The task is to perform operations in such a way that you can make every element in
nums equal to
0. In one operation, you must:
- Choose a positive integer
xis less than or equal to the smallest non-zero element in
xfrom every positive element in
Your goal is to find the minimum number of operations to make every element in
nums equal to
Input: nums = [1,5,0,3,5]
In the first operation, choose x = 1. Now, nums = [0,4,0,2,4].
In the second operation, choose x = 2. Now, nums = [0,2,0,0,2].
In the third operation, choose x = 2. Now, nums = [0,0,0,0,0].
Input: nums = 
Explanation: Each element in nums is already 0, so no operations are needed.
1 <= nums.length <= 100
0 <= nums[i] <= 100
- Implement the
- Export the
- Test the
minimumOperationsfunction with given examples.
For each challenge, the evaluation script will dynamically import and test the corresponding code. Make sure to export the variables, functions, or elements that are required to test the challenges.
When writing tests for this lab, follow these important points:
- The final length of the array
testlogshould be the same as the number of challenges.
- The order of evaluation script try-catch blocks must match the order of challenges written.