-
Notifications
You must be signed in to change notification settings - Fork 1
/
frequentevenelm.java
40 lines (28 loc) · 1.24 KB
/
frequentevenelm.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
package project190;
import java.util.HashMap;
import java.util.Map;
public class frequentevenelm {
public static int mostfrequenteven(int[] nums) {
Map<Integer,Integer> mapp = new HashMap<>();
int maxelm = -1;
int result = Integer.MAX_VALUE;
for(int i:nums){
if(i%2 == 0){ // storing the element if it is even
mapp.put(i,mapp.getOrDefault(i,0)+1);
if(mapp.get(i)>maxelm){ // checking if ttht elm is greater thn other elements
maxelm = Math.max(maxelm,mapp.get(i));
result=i;
}
else if(mapp.get(i) == maxelm && result > i){ //Checking to the elemnet if it is equals to Max Val and element is less than current res
result = i;
}
}
}
return result==Integer.MAX_VALUE? -1: result;
}
public static void main(String[]args){
int nums[] = { 2 , 2 , 2 , 4 ,4 ,4 ,4, 1};
int ans = mostfrequenteven(nums);
System.out.print("The most frequent even element in this array is = " + ans);
}
}