-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathFindDupesInArr.java
More file actions
54 lines (50 loc) · 1.76 KB
/
FindDupesInArr.java
File metadata and controls
54 lines (50 loc) · 1.76 KB
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
49
50
51
52
53
54
import java.util.*;
public class FindDupesInArr {
public static ArrayList<Integer> duplicates(int arr[], int n) {
HashMap<Integer, Integer> freqMap = new HashMap<>();
ArrayList <Integer> dupes = new ArrayList<>();
for (int element : arr) {
freqMap.put(element, freqMap.getOrDefault(element, 0) + 1);
}
for (int element : freqMap.keySet()) {
if (freqMap.get(element) > 1) {
dupes.add(element);
}
}
if (dupes.size() == 0) {
dupes.add(-1);
}
Collections.sort(dupes);
return dupes;
}
public static void main(String[] args) {
// int arr[] = {0, 3, 1, 2};
// int n = 4;
// int arr[] = {2,3,1,2,3};
// int n = 5;
int arr[] = {13, 9, 25, 1, 1, 0, 22, 13, 22, 20, 3, 8, 11, 25, 10, 3, 15, 11, 19, 20, 2, 4, 25, 14, 23, 14};
int n = 26;
ArrayList<Integer> output = duplicates(arr, n);
System.out.println("Output: " + output); // Output:
}
}
// https://www.geeksforgeeks.org/problems/find-duplicates-in-an-array/1?page=1&sortBy=submissions
// works but times out
// ArrayList<Integer> dupes = new ArrayList<>();
// ArrayList<Integer> uniques = new ArrayList<>();
// for (int element : arr) {
// if (!uniques.contains(element)) {
// uniques.add(element);
// System.out.println("Uniques: " + uniques);
// } else {
// if (!dupes.contains(element)) {
// dupes.add(element);
// System.out.println("Dupes: " + dupes);
// }
// }
// }
// if (dupes.size() == 0) {
// dupes.add(-1);
// }
// Collections.sort(dupes);
// return dupes;