-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathSockMerchant.java
42 lines (35 loc) · 1.22 KB
/
SockMerchant.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
// https://www.hackerrank.com/challenges/sock-merchant/problem
package implimentation;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
public class SockMerchant {
private static final Scanner scanner = new Scanner(System.in);
public static void main(String[] args) {
int length = scanner.nextInt();
int[] socks = getArray(length);
System.out.println(pairs(socks));
}
private static int[] getArray(int length) {
int[] array = new int[length];
for (int index = 0 ; index < array.length ; index++) {
array[index] = scanner.nextInt();
}
return array;
}
private static int pairs(int[] array) {
Map<Integer, Integer> frequencies = getFrequencies(array);
int result = 0;
for (Map.Entry<Integer, Integer> entry : frequencies.entrySet()) {
result += entry.getValue() / 2;
}
return result;
}
private static Map<Integer, Integer> getFrequencies(int[] array) {
Map<Integer, Integer> frequencies = new HashMap<>();
for (int number : array) {
frequencies.put(number, frequencies.getOrDefault(number, 0) + 1);
}
return frequencies;
}
}