Solution

Method 1 - Using Set

The problem involves transforming an array so all elements equal the target k. Here's the merged explanation:

Early Feasibility Check: If k is greater than the smallest number in the array, transforming the array into k is impossible. We return -1 immediately to avoid further computations.
Unique Elements Count: Each unique number in the array corresponds to a potential operation required to transform values into k. Using a set, we count unique values in the array.
Optimised Operations: If k is among these unique values, one operation is saved because no transformation is needed for k. Otherwise, the total required operations will match the count of unique values.

Code

[{"language":"Java","code":"class Solution {\n\n    public int minOperations(int[] nums, int k) {\n        int minValue = Integer.MAX_VALUE;\n        for (int num : nums) { // Find the smallest value in nums.\n

Related Tags