Dev.to

3375. Minimum Operations to Make Array Values Equal to K

3375. Minimum Operations to Make Array Values Equal to K Difficulty: Easy Topics: Array, Hash Table You are given an integer array nums and an integer k. An integer h is called valid if all values in the array that are strictly greater than h are identical. For example, if nums = [10, 8, 10, 8], a valid integer is h = 9 because all nums[i] > 9 are equal to 10, but 5 is not a valid integer. You are allowed to perform the following operation on nums: Select an integer h that is valid for the current values in nums. For each index i where nums[i] > h, set nums[i] to h. Return the minimum number of operations required to make every element in nums equal to k. If it is impossible to make all elements equal to k, return -1. Example 1: Input: nums = [5,2,5,4,5], k = 2 Output: 2 Explanation: The operations can be performed in order using valid integers 4 and then 2. Example 2: Input: nums = [2,1,2], k = 2 Output: -1 Explanation: It is impossible to make all the values equal to 2. Example 3: Input: nums = [9,7,5,3], k = 1 Output: 4 Explanation: The operations can be performed using valid integers in the order 7, 5, 3, and 1. Constraints: 1

Apr 9, 2025 - 04:45

Difficulty: Easy

Topics: Array, Hash Table

You are given an integer array nums and an integer k.

An integer h is called valid if all values in the array that are strictly greater than h are identical.

For example, if nums = [10, 8, 10, 8], a valid integer is h = 9 because all nums[i] > 9 are equal to 10, but 5 is not a valid integer.

You are allowed to perform the following operation on nums:

Select an integer h that is valid for the current values in nums.
For each index i where nums[i] > h, set nums[i] to h.

Return the minimum number of operations required to make every element in nums equal to k. If it is impossible to make all elements equal to k, return -1.

Example 1:

Input: nums = [5,2,5,4,5], k = 2
Output: 2
Explanation: The operations can be performed in order using valid integers 4 and then 2.

Example 2:

Input: nums = [2,1,2], k = 2
Output: -1
Explanation: It is impossible to make all the values equal to 2.

Example 3:

Input: nums = [9,7,5,3], k = 1
Output: 4
Explanation: The operations can be performed using valid integers in the order 7, 5, 3, and 1.

Constraints:

1 <= nums.length <= 100
1 <= nums[i] <= 100
1 <= k <= 100

Hint:

Handle the case when the array contains an integer less than k
Start by performing operations on the highest integer
You can perform an operation on the highest integer using the second-highest, an operation on the second-highest using the third-highest, and so forth.
The answer is the number of distinct integers in the array that are larger than k.

Solution:

We need to determine the minimum number of operations required to make all elements of an array equal to a given integer k. Each operation involves selecting a valid integer h such that all elements greater than h are reduced to h. The solution must also check if it is impossible to achieve this goal and return -1 in such cases.

Approach

Check for Impossibility: If any element in the array is less than k, it is impossible to make all elements equal to k because we cannot increase values. In this case, return -1.
Collect Distinct Values: Identify all distinct values in the array that are strictly greater than k. Each distinct value represents a step where we can reduce the elements to the next lower value until we reach k.
Count Steps: The number of distinct values greater than k directly corresponds to the minimum number of operations required. Each operation reduces the highest current value to the next lower distinct value until all elements are k.

Let's implement this solution in PHP: 3375. Minimum Operations to Make Array Values Equal to K


/**
 * @param Integer[] $nums
 * @param Integer $k
 * @return Integer
 */
function minOperations($nums, $k) {
    ...
    ...
    ...
    /**
     * go to ./solution.php
     */
}

// Example 1
print_r(minOperations(array(5, 2, 5, 4, 5), 2)); // Output: 2

// Example 2
print_r(minOperations(array(2, 1, 2), 2)); // Output: -1

// Example 3
print_r(minOperations(array(9, 7, 5, 3), 1)); // Output: 4
?>

Explanation:

Impossibility Check: The code first iterates through the array to check if any element is less than k. If found, it immediately returns -1 as the task is impossible.
Collecting Distinct Values: The code then iterates through the array again to collect all distinct values greater than k using a hash map to ensure uniqueness.
Counting Steps: The count of these distinct values is returned as the result, representing the minimum number of operations needed. Each distinct value requires one operation to reduce it to the next lower value until all elements are k.

This approach efficiently determines the minimum operations by leveraging the distinct values greater than k, ensuring optimal performance with a time complexity of O(n), where n is the length of the array.

Contact Links

If you found this series helpful, please consider giving the repository a star on GitHub or sharing the post on your favorite social networks