LeetCode 2404: Most Frequent Even Element Solution

Master LeetCode problem 2404 (Most Frequent Even Element), a easy challenge, with our optimized solutions in Java, C++, and Python. Explore detailed explanations, test your code in our interactive editor, and prepare for coding interviews.

2404. Most Frequent Even Element

Easy

Array Hash Table Counting

Problem Explanation

Explanation

To solve this problem, we can iterate through the input array and count the frequency of each even number. We maintain a map to store the counts of each even number. After counting the frequencies, we iterate through the map to find the most frequent even number. If there is a tie, we return the smallest even number. If there are no even numbers in the array, we return -1.

Time complexity: O(n) where n is the number of elements in the input array.
Space complexity: O(n) to store the counts of each even number in the map.

Solution Code

import java.util.HashMap;
import java.util.Map;

class Solution {
    public int mostFrequentEvenElement(int[] nums) {
        Map<Integer, Integer> countMap = new HashMap<>();
        int maxFreq = 0;
        int result = -1;
        
        for (int num : nums) {
            if (num % 2 == 0) {
                countMap.put(num, countMap.getOrDefault(num, 0) + 1);
                maxFreq = Math.max(maxFreq, countMap.get(num));
            }
        }
        
        for (int num : countMap.keySet()) {
            if (num % 2 == 0 && countMap.get(num) == maxFreq) {
                if (result == -1 || num < result) {
                    result = num;
                }
            }
        }
        
        return result;
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 2404 (Most Frequent Even Element)?

This page provides optimized solutions for LeetCode problem 2404 (Most Frequent Even Element) in Java, C++, and Python, along with a detailed explanation and an interactive code editor to test your code.

What is the time complexity of LeetCode 2404 (Most Frequent Even Element)?

The time complexity for LeetCode 2404 (Most Frequent Even Element) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 2404 on DevExCode?

Yes, DevExCode provides an interactive code editor where you can write, test, and run your code for LeetCode 2404 in Java, C++, or Python.

Back to LeetCode Solutions