Ergashov Lochinbek // C++ program to find duplicate from an array using

Ergashov Lochinbek

// C++ program to find duplicate from an array using

// unordered_set
#include
using namespace std;

// Print duplicates in arr[0..n-1] using unordered_set

void printDuplicates(int arr[], int n)
{
// declaring unordered sets for checking and storing
// duplicates
unordered_set intSet;
unordered_set duplicate;

// looping through array elements

for (int i = 0; i < n; i++) {
// if element is not there then insert that
if (intSet.find(arr[i]) == intSet.end())
intSet.insert(arr[i]);

// if element is already there then insert into

// duplicate set
else
duplicate.insert(arr[i]);
}

// printing the result

cout << "Duplicate item are : ";
unordered_set::iterator itr;

// iterator itr loops from begin() till end()

for (itr = duplicate.begin(); itr != duplicate.end();
itr++)
cout << *itr << " ";
}

// Driver code

int main()
{
int arr[] = { 1, 5, 2, 1, 4, 3, 1, 7, 2, 8, 9, 5 };
int n = sizeof(arr) / sizeof(int);

printDuplicates(arr, n);

return 0;
}