CareerCup

map mymap;
int givenarr[n];
j = 0
for i = 0 to n - 1
	if not mymap.containskey(givenarr[i])
		givenarr[j++] = givenarr[i]
		mymap[givenarr[i]] = something
while j < n
	givenarr[j++] = Nothing

We can use LinkedHashSet, where repeated values are removed and it maintains the order.

#include<iostream>
#include<set>
#include<vector>
using namespace std;
void main() {
	set<int> rmvDuplicates;
	int n;
	cin>>n;
	vector<int> a(n), res;
	for (int i = 0; i < n; i++) {
		cin>>a[i];
	}
	for (int i = 0; i < n; i++) {
		int oldsize = rmvDuplicates.size();
		rmvDuplicates.insert(a[i]);
		if(rmvDuplicates.size() != oldsize) 
			res.push_back(a[i]);
	}
}