LRU CACHE required

#1

Can u please provide the code of lru cache implementation

#2

int cap;
listkey_list; //stores only keys
unordered_map<int,int>mp;
LRUCache(int capacity) {
cap = capacity;
}

int get(int key) {
    if(mp.find(key) == mp.end() ) return -1;
    
    else{
        key_list.remove(key);
        key_list.push_back(key);
        return mp[key];
    }
}

void put(int key, int value) {
    if(mp.find(key) != mp.end() ){
        mp.erase(key);
        key_list.remove(key);
    }
    if(key_list.size() == cap){
       int temp = key_list.front();
        key_list.pop_front();
        mp.erase(temp);
    }
    mp[key] = value;
    key_list.push_back(key);
    
}
#3

just the build of the req ds