Question

How to get the minimum elements to be deleted to make an array with same values in C++

Answer 1

#include <iostream>
#include <limits.h>
#include <unordered_map>

int minElementsToBeDelete(int arr[], int size) {
    std::unordered_map<int, int> frequency;
    
    for (int i = 0; i < size; i++)
        frequency[arr[i]]++;
        
    int max_frequency = INT_MIN;
    
    for (auto itr = frequency.begin(); itr != frequency.end(); itr++)
        max_frequency = std::max(max_frequency, itr->second);
        
    return size - max_frequency;
}

int main()
{
    int arr[] = { 3, 5, 3, 8, 3, 3, 9, 3, 2, 2 };
    
    int size = sizeof(arr) / sizeof(arr[0]);
    
    std::cout << minElementsToBeDelete(arr, size);
}




/*
run:

5

*/

 

70+ SQL courses for beginners and professionals