Most Frequent Even Element — LeetCode 2404 Python Solution

The problem

Given an integer array nums, return the most frequent even element. If there is a tie, return the smallest one.

Example

Input

nums = [0,1,2,2,4,4,1]

Output

2

Explanation

The even elements are 0, 2, and 4. Of these, 2 and 4 appear the most.

Python solution

class Solution:
    def mostFrequentEven(self, nums: List[int]) -> int:
        cnt = Counter(x for x in nums if x % 2 == 0)
        ans, mx = -1, 0
        for x, v in cnt.items():
            if v > mx or (v == mx and ans > x):
                ans, mx = x, v
        return ans

Complexity

Pattern: Hash Map

Trade memory for time: remember what you have seen so the second pass never happens. LeetCode 2404. Most Frequent Even Element is filed here on both counts: the reference solution below belongs to the algorithm family this hub collects, and LeetCode tags it Hash Table and Counting.

The hash map guide has the Python template for the pattern and the 709 LeetCode problems that use it.

Related problems