Insert Delete GetRandom O(1).cpp

/* 

    Solution by Rahul Surana
    
    ***********************************************************


Implement the RandomizedSet class:

RandomizedSet() Initializes the RandomizedSet object.

bool insert(int val) Inserts an item val into the set if not present. Returns true if the item was not present, false otherwise.

bool remove(int val) Removes an item val from the set if present. Returns true if the item was present, false otherwise.

int getRandom() Returns a random element from the current set of elements (it's guaranteed that at least one element exists 
when this method is called). Each element must have the same probability of being returned.

You must implement the functions of the class such that each function works in average O(1) time complexity.



    ***********************************************************
*/


#include <bits/stdc++.h>

class RandomizedSet {
public:
    
    unordered_map<int,int> s;
    vector<int> v;
    
    RandomizedSet() {
        
    }
    
    bool insert(int val) {
        if(s.count(val) != 0) return false;
        s[val] = v.size();
        v.push_back(val);
        return true;
    }
    
    bool remove(int val) {
        if(s.count(val) == 0) return false;
        int i = s[val];
        v[i] = v[v.size()-1];
        v.pop_back();
        s[v[i]] = i;
        s.erase(val);
        return true;
    }
    
    int getRandom() {
        return v[rand()%v.size()];
    }
};

/**
 * Your RandomizedSet object will be instantiated and called as such:
 * RandomizedSet* obj = new RandomizedSet();
 * bool param_1 = obj->insert(val);
 * bool param_2 = obj->remove(val);
 * int param_3 = obj->getRandom();
 */