• Home
• com.github.javadev
• leetcode-in-java
• 1.38
• source code
• readme.md

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

g2401_2500.s2404_most_frequent_even_element.readme.md Maven / Gradle / Ivy

2404\. Most Frequent Even Element

Easy

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`.

**Example 1:**

**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.

We return the smallest one, which is 2.

**Example 2:**

**Input:** nums = [4,4,4,9,2,4]

**Output:** 4

**Explanation:** 4 is the even element appears the most. 

**Example 3:**

**Input:** nums = [29,47,21,41,13,37,25,7]

**Output:** -1

**Explanation:** There is no even element. 

**Constraints:**

*   `1 <= nums.length <= 2000`
*   0 <= nums[i] <= 105