How can I remove duplicate elements from a C++ array?

How can I remove duplicate elements from a C++ array?

You can use a set to store unique elements. Here's a simple example:

#include <iostream>
#include <set>
#include <vector>

void removeDuplicates(std::vector<int>& arr) {
    std::set<int> uniqueElements;
    for (int num : arr) {
        uniqueElements.insert(num);
    }
    arr.assign(uniqueElements.begin(), uniqueElements.end());
}

Can you explain how this code works?

Sure! The code uses a set to automatically handle duplicates. As you iterate through the array, each element is inserted into the set, which only keeps unique values. Finally, we assign the unique values back to the original array.

What if I want to keep the original order of elements?

In that case, you can use a vector along with a set to track seen elements. Here's an example:

#include <iostream>
#include <vector>
#include <set>

std::vector<int> removeDuplicatesMaintainOrder(const std::vector<int>& arr) {
    std::set<int> seen;
    std::vector<int> result;
    for (int num : arr) {
        if (seen.insert(num).second) {
            result.push_back(num);
        }
    }
    return result;
}