Spravne hodnoty su nasledovne:
0
1
2
3
3
4
5
5
6
7
6
9
10
11
8
11
12
11
13
15
16
15
17
17
19
20
20
20
22
21
23
24
25
26
25
29
28
29
31
31
32
32
32
34
36
35
38
38
38
38
40
39
39
41
42
42
44
44
46
44
47
47
48
51
51
52
51
49
55
53
55
54
59
59
58
59
59
61
63
63
64
65
64
67
67
67
67
69
70
70
69
73
73
71
73
76
74
80
80
77

Zo spravnych rieseni sme vybrali jedno nasledujuce:

private int cleanArray(List<Integer> numbers) {
        Map<Integer, Long> counter = numbers.stream().collect(Collectors.groupingBy(number -> number, Collectors.counting()));
        return (int) (numbers.size() - Collections.max(counter.entrySet(), Map.Entry.comparingByValue()).getValue());
}