map.cpp

#include <bits/stdc++.h>
using namespace std;

#define int long long int
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define cins(x) for (auto &i : x) cin >> i
#define vi vector<int>
#define vvi vector<vi>
#define mii map<int, int>
#define pi 3.14159265358979323846264338327950
#define pii pair<int, int>
#define vpi vector<pii>
#define ff first
#define ss second
#define setbits(x) __builtin_popcount(x)
#define endl '\n';
#define in insert
#define pb push_back
#define f(i, a, b) for (int i = a; i < b; i += 1)
#define rev(i, a, b, c) for (int i = a - 1; i >= b; i -= c)
#define FOR(x) for(auto it = x.begin();it!=x.end();it++)
#define COUT(x) for(auto &i : x) cout<<i<<" ";
#define MAX(x) *max_element(all(x));
#define MIN(x) *min_element(all(x));
#define SUM(x) accumulate(all(x), 0ll);

#define Y cout<<"YES"<<endl
#define N cout<<"NO"<<endl

typedef unsigned long long ull;
typedef long double lld;

#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x<<" "; _print(x); cerr << endl;
#else
#define debug(x);
#endif

//-----------------some_fxns-------------------//

bool isSquare(int x) {int y = sqrtl(x); return x == y * y;}
bool ispow2(int x) {return (x ? !(x & (x - 1)) : 0);}
int ceils(int x, int y) {return (x >= 0 ? (x + y - 1) / y : x / y);}
int gcd(int x, int y) {return (x ? gcd(y % x, x) : y);}
int lcm(int x, int y) {return x / gcd(x, y) * y;}
vi dx = {0,0,1,-1,1,1,-1,-1};
vi dy = {1,-1,0,0,1,-1,1,-1};
const int mod = 1e9+7;
const int MAXX = 2e5+5;

//------------------------------------------------//

void _print(int t) {cerr << t;}
void _print(string t) {cerr << t;}
void _print(char t) {cerr << t;}
void _print(double t) {cerr << t;}
void _print(ull t) {cerr << t;}
void google(int t) {cout << "Case #" << t << ": ";}

 
template <class T, class V> void _print(pair <T, V> p);
template <class T> void _print(vector <T> v);
template <class T> void _print(set <T> v);
template <class T, class V> void _print(map <T, V> v);
template <class T, class V> void _print(unordered_map <T, V> v);
template <class T> void _print(multiset <T> v);
template <class T, class V> void _print(pair <T, V> p) {cerr << "{"; _print(p.ff); cerr << ","; _print(p.ss); cerr << "}";}
template <class T> void _print(vector <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T> void _print(set <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T> void _print(multiset <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T> void _print(unordered_set <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}

template <class T, class V> void _print(map <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}

//--------------------------------------------SOLUTION OF THE PROBLEM--------------------------?//
struct Node{
    int val;
    int key;
    Node* next;
    Node(int k, int v){
        val = v;
        key = k;
        next = NULL;
    }
};
class MyHashMap {
public:
    vector<Node*> arr;
    MyHashMap() {
        arr.assign(10007, NULL);
    }
    
    int hash(int key){
        return key % 10007;
    }
    void put(int key, int value) {
        int h = hash(key);
        
        if(arr[h] == NULL){
            arr[h] = new Node(key, value);
        }
        else{
            Node * ptr = arr[h];
            while(ptr->next and ptr->key != key){
                ptr = ptr->next;
            }
            if(ptr->key == key){
                ptr->val = value;
            }else{
                ptr->next = new Node(key, value);
            }
        }
    }
    
    int get(int key) {
        int h = hash(key);
        if(arr[h]==NULL){
            return -1;
        }else{
            Node * ptr = arr[h];
            while(ptr){
                if(ptr->key == key){
                    return ptr->val;
                }
                ptr = ptr->next;
            }
            return -1;
        }
    }
    
    void remove(int key) {
        int h = hash(key);
        Node * ptr = arr[h], * prev = NULL;

        while(ptr){
            if(ptr->key == key){
                if(prev == NULL){
                    arr[h] = ptr->next;
                }else{
                    prev->next = ptr->next;
                    
                }
                delete(ptr);
                return;
            }
            prev = ptr;
            ptr = ptr->next;
        }
    }
};
void solve(){
    /* हर हर महादेव */
    MyHashMap mp;
    mp.put(1, 2);
    mp.put(2, 3);
    mp.put(3, 4);
    mp.put(2, 5);
    cout<<mp.get(2);
    mp.remove(2);
    cout<<mp.get(2);

    //similar implementation can be done for hash map
}

int32_t main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.precision(20);
    cout.setf(ios::fixed);
    #ifndef ONLINE_JUDGE
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
        freopen("Error.in", "w", stderr);
    #endif
    
    int t;
    cin >> t;
    while(t--){
        solve();
    }
    return 0;
}