-
Notifications
You must be signed in to change notification settings - Fork 0
/
1669B.java
48 lines (39 loc) · 930 Bytes
/
1669B.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
41
42
43
44
45
46
47
48
import java.util.Scanner;
import java.util.HashMap;
public class Main {
public static void main(String []args) {
Scanner input = new Scanner(System.in);
int t = input.nextInt();
for(int i = 0; i < t; i++) {
int n = input.nextInt();
int[] arr;
arr = new int[n];
for(int j = 0; j < n; j++) {
arr[j] = input.nextInt();
}
HashMap<Integer, Integer> m = new HashMap<Integer, Integer>();
for(int j = 0; j < n; j++) {
if(m.containsKey(arr[j]) == true) {
int c = m.get(arr[j]);
m.put(arr[j], c+1);
} else {
m.put(arr[j], 1);
}
}
boolean flag = false;
for(Integer k : m.keySet()) {
int frequency = m.get(k);
// System.out.printf("%d, %d\n", k, frequency);
if (frequency >= 3) {
System.out.println(k);
flag = true;
break;
}
}
if (flag == false) {
System.out.println(-1);
}
}
input.close();
}
}