2170. Minimum Operations to Make the Array Alternating

MediumGreedyArrayHash TableCounting

Problem Description

You are provided with an array nums which contains n positive integers, and it is indexed starting from 0. These types of arrays have a particular characteristic to be called "alternating". For an array to be considered alternating, it must satisfy two conditions:

Every element at an even index (except the first) must be equal to the element two places before it. Mathematically, this is expressed as nums[i - 2] == nums[i] for i ranging from 2 to n - 1.
Every element at an odd index must be different from the element immediately preceding it. This is expressed as nums[i - 1] != nums[i] for i ranging from 1 to n - 1.

The goal is to calculate the minimum number of changes needed to be made to the array to achieve the "alternating" property. Each operation allows you to choose an index i and change the element nums[i] to any positive integer of your choosing.

Intuition

To minimize the number of operations needed to make the array alternating, we should make the most frequent elements in even and odd positions stay the same as much as possible since changing them would require more operations.

The solution involves the following steps:

Separate the numbers in the array into two groups based on their indices: one consisting of the numbers at even indices and the other consisting of those at odd indices.
Count the frequency of each number in both even and odd indexed groups. Find the most common elements (we might need the two most common elements from each group in case the most common elements in both groups are the same).
Calculate the minimum operations needed by considering the most common elements. If the most common element in the even-indexed group is different from the most common in the odd-indexed group, we'll keep those and change the rest. If they are the same, we have to look at the second most common elements to decide which will require fewer changes.
The minimum number of operations is the total length of the array minus the sum of the counts of the chosen elements for even and odd indices.

The provided code determines the most common elements and their frequencies for even and odd positions separately and then uses a generator to compute the minimum necessary changes, considering the cases where the most common even and odd elements might be the same.

Learn more about Greedy patterns.

Solution Approach

In the provided solution, several key programming concepts and data structures are utilized:

Counter from collections module: The Counter class in Python's collections module is used to count the frequency of each element in both the even-indexed and odd-indexed subarrays of nums. By calling Counter(nums[i::2]).most_common(2), we get the top two most common elements and their respective counts for the subarray starting at index i with a step of 2 (meaning every other element starting from i).
List slicing: The slice operation nums[i::2] generates a new list containing every second element of nums starting from index i. This is used to separate the original array into the aforementioned even-indexed and odd-indexed subarrays.
Tuple unpacking and conditional expression: Tuples are used to represent the elements and their counts returned by most_common(). The conditional expression is used to return a default count of zero when there is only one common element found by most_common().
List comprehensions and generator expressions: The min() function is used with a generator expression that iterates over all possible combinations of elements and their counts for even and odd positions. The generator expression is min(n - (n1 + n2) for a, n1 in get(0) for b, n2 in get(1) if a != b). If the element for the even position (a) is the same as for the odd position (b), that particular combination is ignored (if a != b). Otherwise, n1 and n2 are the frequency counts of the chosen elements, and n - (n1 + n2) computes the number of changes needed.
Function definition: The get function is defined to encapsulate the functionality of getting the two most common elements from either the even-indexed or odd-indexed numbers. It handles edge cases where there might be less than two elements returned from the Counter.

By combining these tools and methods, the solution efficiently calculates the minimum number of operations needed to make the input array alternating. The use of Counter and most_common methods has a time complexity of O(N), where N is the length of the array. Since we iterate over at most four combinations (two from each list split), the total complexity remains O(N).

Ready to land your dream job?

Unlock your dream job with a 2-minute evaluator for a personalized learning plan!

Start Evaluator

Example Walkthrough

Let's consider a small example to illustrate the solution approach described above. Suppose we are given the following array nums:

nums = [1, 2, 2, 3, 1, 5]

During the walkthrough, we'll use the steps detailed in the solution approach.

Step 1: Separation into even and odd indexed groups
Separate nums into two groups based on indices:
Even-indexed group: [1, 2, 1] (elements at indices 0, 2, 4)
Odd-indexed group: [2, 3, 5] (elements at indices 1, 3, 5)

Step 2: Count the frequency
Count the frequency of elements in each group:
Even-indexed group: 1 appears 2 times, 2 appears 1 time
Odd-indexed group: 2, 3, and 5 each appear 1 time

Step 3: Find the most common elements
Identify the most common elements:
Even-indexed most common element: 1, with frequency 2
Odd-indexed most common element: Each element has the same frequency 1, but let's say we choose 2
Since 2 is also present in even-indexed group but is not the most frequent, we consider it for the odd group. No conflict yet.

Step 4: Calculate the minimum operations
Calculate the minimum changes needed:

If we keep element 1 in the even positions, we need to change one element (2 at index 2).
For the odd positions, if we choose to keep 2, we don't need to make any changes.

Summarizing the changes:

Total array length = 6
Count of 1's in even-indexed group = 2
Count of 2's in odd-indexed group = 1 (since we only need to consider odd-indexed positions)

Minimum number of operations = Total length - (Even count + Odd count)
= 6 - (2 + 1)
= 3 changes

In a scenario where the most frequent even and odd elements were the same, we would require looking at the second most common elements, but in our example, this isn't the case.

By applying the solution approach, we understand that to make nums alternating, we need to make 3 changes: replace the second element of the even group and two elements of the odd group that are not 2.

Solution Implementation

1from collections import Counter  # Importing Counter from collections module
2
3class Solution:
4    def minimumOperations(self, nums: List[int]) -> int:
5        # Internal function to get the two most common elements and their counts in alternating indices.
6        def get_most_common_alternate(idx):
7            # Count the elements at alternating indices starting from idx
8            counts = Counter(nums[idx::2]).most_common(2)  
9            # If there are no elements, return two pairs of zeros
10            if not counts:
11                return [(0, 0), (0, 0)]     
12            # If there is only one element, return it with a pair of zeros
13            if len(counts) == 1:
14                return [counts[0], (0, 0)]    
15            # Otherwise return the two most common elements and their counts
16            return counts        
17
18        # This stores the length of the nums list
19        n = len(nums)   
20        # The result is the minimum count of operations which is obtained by taking the
21        # total count 'n' minus the sum of counts of the two most common elements at
22        # alternating indices that are not the same.
23        return min(
24            n - (count_even + count_odd)  # Calculate the minimum number
25            for value_even, count_even in get_most_common_alternate(0)  # Get most common at even indices
26            for value_odd, count_odd in get_most_common_alternate(1)  # Get most common at odd indices
27            if value_even != value_odd  # Only consider pairs with different values
28        )
29
30```
31
32Please note that `List` must be imported from `typing` if it hasn't been defined earlier in the code. Otherwise, Python will raise a `NameError`. Here's how you can import it:
33
34```python
35from typing import List
36

1class Solution {
2    private int[] numbers; // An array of numbers
3    private int arrayLength; // Length of the numbers array
4
5    // Calculates the minimum number of operations required
6    public int minimumOperations(int[] nums) {
7        this.numbers = nums; // Assigns passed array to the numbers property
8        arrayLength = nums.length; // Assigns array length to arrayLength property
9        int minOperations = Integer.MAX_VALUE; // Initialize minimum operations with the maximum integer value
10
11        // Generate frequency arrays for even and odd indices, and compare them
12        for (int[] evenFreqElement : getFrequency(0)) {
13            for (int[] oddFreqElement : getFrequency(1)) {
14                // Ensure that we consider different values (from even and odd indices)
15                if (evenFreqElement[0] != oddFreqElement[0]) {
16                    // Calculate and update the minimum operations needed
17                    minOperations = Math.min(minOperations, arrayLength - (evenFreqElement[1] + oddFreqElement[1]));
18                }
19            }
20        }
21        return minOperations; // return the minimum operations calculated
22    }
23
24    // Generates a 2D array containing the two most frequent elements and their counts at either even or odd indices
25    private int[][] getFrequency(int start) {
26        Map<Integer, Integer> frequencyMap = new HashMap<>(); // Map to keep track of frequency of elements
27        // Loop through the numbers array, incrementing by 2 from the specified start index
28        for (int i = start; i < arrayLength; i += 2) {
29            frequencyMap.put(numbers[i], frequencyMap.getOrDefault(numbers[i], 0) + 1); // Update frequency map
30        }
31        int topValue = 0; // Most frequent number
32        int topCount = 0; // Count of the most frequent number
33        int secondValue = 0; // Second most frequent number
34        int secondCount = 0; // Count of the second most frequent number
35
36        // Iterate over the frequency map to find the most and second most frequent numbers
37        for (Map.Entry<Integer, Integer> entry : frequencyMap.entrySet()) {
38            int key = entry.getKey();
39            int value = entry.getValue();
40            // If current frequency is greater than the most frequent, update top and second top frequencies and values
41            if (value > topCount) {
42                secondValue = topValue;
43                secondCount = topCount;
44                topValue = key;
45                topCount = value;
46            } else if (value > secondCount) { // If current is only greater than second, update only second most frequent
47                secondValue = key;
48                secondCount = value;
49            }
50        }
51        // Return an array of arrays, where each array is of format: {element value, frequency count}
52        return new int[][] {{topValue, topCount}, {secondValue, secondCount}};
53    }
54}
55

1#include <vector>
2#include <unordered_map>
3#include <climits>
4#include <utility>
5using namespace std;
6
7// Define a pair of integers for easier handling of operations.
8typedef pair<int, int> IntPair;
9
10class Solution {
11public:
12    int minimumOperations(vector<int>& nums) {
13        int minOperations = INT_MAX; // Initialize with the maximum possible integer value.
14        int size = nums.size(); // Get the size of the input array.
15        // Get the frequency pairs of numbers appearing at even indices.
16        for (const auto& [numEven, frequencyEven] : getFrequency(0, nums)) {
17            // Get the frequency pairs of numbers appearing at odd indices.
18            for (const auto& [numOdd, frequencyOdd] : getFrequency(1, nums)) {
19                // Ensure we are not considering the same number for both even and odd positions.
20                if (numEven != numOdd) {
21                    // Calculate the minimum operations required and update minOperations.
22                    minOperations = min(minOperations, size - (frequencyEven + frequencyOdd));
23                }
24            }
25        }
26        return minOperations; // Return the calculated minimum operations.
27    }
28
29    // Helper method to get top two frequent numbers and their counts from even or odd indices.
30    vector<IntPair> getFrequency(int startIndex, vector<int>& nums) {
31        unordered_map<int, int> frequencyMap; // Map to hold number frequencies.
32
33        // Build frequency map for numbers at indices determined by startIndex (even or odd).
34        for (int i = startIndex; i < nums.size(); i += 2) {
35            ++frequencyMap[nums[i]];
36        }
37
38        // Variables to keep track of the two most frequent numbers and their counts.
39        int firstNum = 0, firstCount = 0;
40        int secondNum = 0, secondCount = 0;
41
42        // Find the two most frequent numbers.
43        for (const auto& [currentNum, count] : frequencyMap) {
44            if (count > firstCount) {
45                // Update second most frequent number before changing the most frequent one.
46                secondNum = firstNum;
47                secondCount = firstCount;
48                firstNum = currentNum;
49                firstCount = count;
50            } else if (count > secondCount) {
51                secondNum = currentNum;
52                secondCount = count;
53            }
54        }
55
56        // Return the top two frequent numbers and their counts.
57        return {{firstNum, firstCount}, {secondNum, secondCount}};
58    }
59};
60

1/**
2 * Finds the minimum number of operations required to make all the even-indexed elements
3 * equal and all the odd-indexed elements equal, but not necessarily equal to each other
4 * @param nums The input array of numbers
5 * @returns The minimum number of operations required
6 */
7function minimumOperations(nums: number[]): number {
8    const length = nums.length;
9    const maxValue = 10 ** 5;
10  
11    // Initialize frequency arrays for odd-indexed and even-indexed elements
12    let oddFrequencies = new Array(maxValue).fill(0);
13    let evenFrequencies = new Array(maxValue).fill(0);
14
15    // Populate the frequency arrays
16    for (let i = 0; i < length; i++) {
17        const current = nums[i];
18        if (i % 2 === 1) {
19            oddFrequencies[current]++;
20        } else {
21            evenFrequencies[current]++;
22        }
23    }
24
25    // Find the max frequency element for odd and even indices
26    let oddIndexMax = oddFrequencies.indexOf(Math.max(...oddFrequencies));
27    let evenIndexMax = evenFrequencies.indexOf(Math.max(...evenFrequencies));
28
29    // If the max frequency elements are different, the answer is straightforward
30    if (oddIndexMax !== evenIndexMax) {
31        return length - oddFrequencies[oddIndexMax] - evenFrequencies[evenIndexMax];
32    } else {
33        // Handle the case when the max frequency elements are the same
34
35        let oddMaxFreq = oddFrequencies[oddIndexMax];
36        let evenMaxFreq = evenFrequencies[evenIndexMax];
37
38        // Zero out the max frequency elements to find the second max
39        oddFrequencies[oddIndexMax] = 0;
40        evenFrequencies[evenIndexMax] = 0;
41
42        let oddSecondMaxIndex = oddFrequencies.indexOf(Math.max(...oddFrequencies));
43        let evenSecondMaxIndex = evenFrequencies.indexOf(Math.max(...evenFrequencies));
44
45        // The answer is the max of either changing the even-indexed or the odd-indexed elements
46        return length - Math.max(
47            oddMaxFreq + evenFrequencies[evenSecondMaxIndex],
48            evenMaxFreq + oddFrequencies[oddSecondMaxIndex]
49        );
50    }
51}
52

Time and Space Complexity

Time Complexity

The time complexity of the provided code can be analyzed by examining the operations within the minimumOperations function.

get Function Call for Half of the Array (Based on Even and Odd Indices): This operation involves creating a Counter on half of the array, which takes O(n/2), where n is the length of nums. Since the get function is called twice, once for even indices and once for odd indices, this results in a complexity of O(n).
Counter(nums[i::2]).most_common(2): This operation finds the two most common elements in the Counter object. The Counter.most_common method has O(n log k) complexity, where k is the number of most common elements requested. Since k is constant (2 in this case), the complexity for this step simplifies to O(n) (for half of the list, but effectively O(n) since called twice for both halves of the list).
The list comprehension iterates through all combinations of two most common elements for even and odd indices. In the worst case, there are 2 elements from the first half and 2 from the second half, creating 4 combinations to consider. This is a constant factor and does not depend on n, so it is O(1).

Therefore, the overall time complexity of the provided code is O(n).

Space Complexity

The space complexity can be determined by examining the memory use relative to the input size:

The Counter object in the get method stores the frequencies of elements for half of the array, assuming a worst-case scenario where all items are unique this would be O(n/2), but since it's called twice, the space complexity is O(n) in total for both Counters.
The most common elements are stored as a list of tuples, with up to four tuples stored at any time (most_common(2) for two halves). This is a constant space O(1).

Therefore, the overall space complexity of the code is O(n).

Learn more about how to find time and space complexity quickly using problem constraints.

Discover Your Strengths and Weaknesses: Take Our 2-Minute Quiz to Tailor Your Study Plan:

Question 1 out of 10

What's the output of running the following function using input 56?

1KEYBOARD = {
2    '2': 'abc',
3    '3': 'def',
4    '4': 'ghi',
5    '5': 'jkl',
6    '6': 'mno',
7    '7': 'pqrs',
8    '8': 'tuv',
9    '9': 'wxyz',
10}
11
12def letter_combinations_of_phone_number(digits):
13    def dfs(path, res):
14        if len(path) == len(digits):
15            res.append(''.join(path))
16            return
17
18        next_number = digits[len(path)]
19        for letter in KEYBOARD[next_number]:
20            path.append(letter)
21            dfs(path, res)
22            path.pop()
23
24    res = []
25    dfs([], res)
26    return res
27

1private static final Map<Character, char[]> KEYBOARD = Map.of(
2    '2', "abc".toCharArray(),
3    '3', "def".toCharArray(),
4    '4', "ghi".toCharArray(),
5    '5', "jkl".toCharArray(),
6    '6', "mno".toCharArray(),
7    '7', "pqrs".toCharArray(),
8    '8', "tuv".toCharArray(),
9    '9', "wxyz".toCharArray()
10);
11
12public static List<String> letterCombinationsOfPhoneNumber(String digits) {
13    List<String> res = new ArrayList<>();
14    dfs(new StringBuilder(), res, digits.toCharArray());
15    return res;
16}
17
18private static void dfs(StringBuilder path, List<String> res, char[] digits) {
19    if (path.length() == digits.length) {
20        res.add(path.toString());
21        return;
22    }
23    char next_digit = digits[path.length()];
24    for (char letter : KEYBOARD.get(next_digit)) {
25        path.append(letter);
26        dfs(path, res, digits);
27        path.deleteCharAt(path.length() - 1);
28    }
29}
30

1const KEYBOARD = {
2    '2': 'abc',
3    '3': 'def',
4    '4': 'ghi',
5    '5': 'jkl',
6    '6': 'mno',
7    '7': 'pqrs',
8    '8': 'tuv',
9    '9': 'wxyz',
10}
11
12function letter_combinations_of_phone_number(digits) {
13    let res = [];
14    dfs(digits, [], res);
15    return res;
16}
17
18function dfs(digits, path, res) {
19    if (path.length === digits.length) {
20        res.push(path.join(''));
21        return;
22    }
23    let next_number = digits.charAt(path.length);
24    for (let letter of KEYBOARD[next_number]) {
25        path.push(letter);
26        dfs(digits, path, res);
27        path.pop();
28    }
29}
30

["jk", "mno"]

["jm", "kn", "lo"]

["jklmnp"]

["jm","jn","jo","km","kn","ko","lm","ln","lo"]

I don’t know