Given a ternary array (every element has one the three possible values 1, 2 and 3). Our task is to replace the minimum number of numbers in it so that all the numbers in the array are equal to each other.
Input : arr = 1 3 2 2 2 1 1 2 3 Output : 5 In this example, frequency of 1 is 3, frequency of 2 is 4 and frequency of 3 is 2. As we can see that 2 is having the more frequency than 1 and 3. So, if we replace all the 1's and 3's by 2 then, the resultant array has all the elements equal to each other in minimum replacements. Here, total no. of 1's and 3's is 5 so it takes 5 replacements to replace them by 2. Hence, the output is 5. Input : arr = 3 3 2 2 1 3 Output : 3 In this example, 3 has the max frequency. Hence, minimum number of replacements are 3 to replace 1 and 2 by 3. Hence, the output is 3.
The approach is to calculate frequency of each element of the given array. Then, the difference of n(no. of elements) and max_frequency(frequency of the element occurs maximum time in the array) will be minimum number of replacements needed.
- Lexicographically smallest permutation with distinct elements using minimum replacements
- Minimum array element changes to make its elements 1 to N
- Minimum gcd operations to make all array elements one
- Minimum number of operations on an array to make all elements 0
- Minimum operations to make all elements equal using the second array
- Minimum cost to make all array elements equal
- Minimum operation to make all elements equal in array
- Minimum steps to make sum and the product of all elements of array non-zero
- Make all the array elements odd with minimum operations of given type
- Minimum no. of operations required to make all Array Elements Zero
- Make array elements equal with minimum cost
- Make all array elements equal with minimum cost
- Minimum steps to make all the elements of the array divisible by 4
- Minimum delete operations to make all elements of array same
- Minimum Bitwise AND operations to make any two array elements equal