2404. Most Frequent Even Element

Given an integer array nums, return the most frequent even element.

If there is a tie, return the smallest one. If there is no such element, return -1.

class Solution {
public:
    int mostFrequentEven(vector<int>& nums) {
        unordered_map<int,int> freq;
        int ma = -1, res = -1;
        for(auto& n : nums) {
            if(n & 1) continue;
            freq[n]++;
            if(freq[n] > ma) {
                ma = freq[n];
                res = n;
            } else if(freq[n] == ma) {
                res = min(res, n);
            }
        }
        return res;
    }
};