Unordered_set_map

#include<bits/stdc++.h>
using namespace std;
//Avg Time complexity O(1)
//Avg Space complexity O(N)
int main(){
    int n=4;
    unordered_set<int>s;
    s = {2,4,1,6};
    unordered_set<int> s:: iterator it;
    for(it=s.begin(); it!=s.end(); it++){
        cout<<*it<<" ";
    }


}