#include <iostream>
#include <unordered_set>
void findDuplicates(int arr[], int n) {
std::unordered_set<int> seen;
std::unordered_set<int> duplicates;
for (int i = 0; i < n; ++i) {
if (seen.find(arr[i]) != seen.end()) {
duplicates.insert(arr[i]);
} else {
seen.insert(arr[i]);
}
}
if (duplicates.empty()) {
std::cout << "No duplicates found." << std::endl;
} else {
std::cout << "Duplicates: ";
for (int num : duplicates) {
std::cout << num << " ";
}
std::cout << std::endl;
}
}
int main() {
int arr[] = {4, 3, 2, 7, 8, 2, 6, 1, 2, 3};
int n = sizeof(arr) / sizeof(arr[0]);
findDuplicates(arr, n);
return 0;
}