HashMap_Analyzer.cpp

#include "HashMap_Analyzer.h"
#include <unordered_map>
using namespace std;

int HashMapAnalyzer::getMostCommonLength(const vector<int>& lengths) {

    //creating a hash table to count frequency; increases count for each element in the length's vector
    unordered_map<int, int> frequency;
    for (int lenth : lengths) {
        frequency[lenth]++;
    }

    //variables to keep track of the length that has the highest frequency
    int maxLenth = 0;
    int maxFrequency = 0;

    //iterate through frequency table to find the most common lenght and update those values
    for (const auto& [lenth, count] : frequency) {
        if (count > maxFrequency) {
            maxFrequency = count;
            maxLenth = lenth;
        }
    }

    //returning the length that appeared the most often
    return maxLenth;
}