dev.cpp

#include <iostream>
#include <string>
#include <vector>
#include <list>
#include <map>

using namespace std;


class SimpleHashTable {
    private:
        static const int TABLE_SIZE = 100;
        vector<list<pair<int, string>>>table;

        int hashFunction(int key) {
            return key % TABLE_SIZE;
        }

    public:
        SimpleHashTable(): table(TABLE_SIZE) {}

        void insert(int key, const string& value) {
            int index = hashFunction(key);

            for (auto& p : table[index]) {
                if (p.first == key) {
                    p.second = value;
                    return;
                }
            }

            table[index].push_back({key, value});
        }

        string get(int key) {
            int index = hashFunction(key);

            for (const auto& p : table[index]) {
                if (p.first == key) {
                    return p.second;
                }
            }

            return "Key not found";
        }

        bool remove(int key) {
            int index = hashFunction(key);

            for (auto it = table[index].begin(); it != table[index].end(); ++it) {
                if (it->first == key) {
                    table[index].erase(it);
                    return true;
                }
            }

            return false;
        }

        bool contains(int key) {
            int index = hashFunction(key);

            for (const auto& p : table[index]) {
                if (p.first == key) {
                    return true;
                }
            }

            return false;
        }
};

int main() {
    switch (1)
    {
    case 1:
        /* code */
        break;
    
    default:
        break;
    }
    // SimpleHashTable s;
    // s.insert(1, "Akrom");
    // s.insert(101, "Collision");

    // cout << s.get(1) << endl;
    // cout << s.get(101) << endl;
    // s.remove(1);

    // cout << s.contains(1) << endl;

    return 0;
}