Make Array Zero by Subtracting Equal Amounts (LC 2375 :)

Problem Overview

• Determine the minimum number of operations to turn all elements of a non-negative integer array to 0.
• Each operation selects x ≤ the smallest non-zero value and subtracts x from every positive element; output the count of operations.
• Input: nums with 1 ≤ length ≤ 100 and 0 ≤ nums[i] ≤ 100; Output: an integer.
• Represents batch reduction/normalization across values in array processing contexts.
• An Amazon interviews coding interview problem often cited as an interview question.