Question

Write a C++ application to find the smallest number in the list which has the maximum number of repetitions.

Ex.

8,11,2,2,3,4,6,3,3,9,2,3,3,15

The smallest number in the list is 3 with maximum repetitions of 4.

Show the output with the number and its repetition count.

Answer 1

#include <iostream>

using namespace std;

int maxRepetitions(int *arr, int size, int &maxCount) {
    int num = arr[0];
    maxCount = 0;
    for (int i = 0; i < size; ++i) {
        int count = 0;
        for (int j = 0; j < size; ++j) {
            if (arr[i] == arr[j])
                count++;
        }
        if (count > maxCount || (count == maxCount && arr[i] < num)) {
            num = arr[i];
            maxCount = count;
        }
    }
    return num;
}

int main() {
    int num, maxCount;
    int arr[] = {8, 11, 2, 2, 3, 4, 6, 3, 3, 9, 2, 3, 3, 15};
    num = maxRepetitions(arr, sizeof(arr) / sizeof(int), maxCount);
    cout << "The smallest number in the list is " << num << " with maximum repetitions of " << maxCount << "." << endl;
    return 0;
}