I have implemented a Python dictionary-like hashmap for Task 1.

You can choose the capacity of the hashmap; however, it will automatically increase if it's filled up to 70% of its capacity. This behavior is similar to Python's defaultdict.

To optimize memory usage, I initialize the hashmap with a list of None values. This approach consumes less memory initially compared to a fully populated list. However, this can impact speed because we need to check if an element is filled or not, which doubles the time required to put elements.

Python lists have O(1) time complexity for most operations, making our hashmap efficient.

To use this implementation, follow these steps:

1. Make sure you have Python 3.10 installed on your system.

2. Create a virtual environment (venv) for this project:

   python3.10 -m venv venv

3. Activate the virtual environment:

   • On Windows:

     venv\Scripts\activate

   • On macOS and Linux:

     source venv/bin/activate

4. Install the required packages:

   pip install -r requirements.txt

5. Run the tests for Task 1 located in the "task1" folder:

   python task1/test_task1.py

For Task 2, I have chosen to use the unittest library for testing.

I've opted for an in-memory database for testing purposes, as it's faster and more suitable for testing scenarios.

To use this implementation, follow these steps:

1. Make sure you have Python 3.10 installed on your system.

2. Create a virtual environment (venv) for this project:

   python3.10 -m venv venv

3. Activate the virtual environment:

   • On Windows:

     venv\Scripts\activate

   • On macOS and Linux:

     source venv/bin/activate

4. Install the required packages:

   pip install -r requirements.txt

5. Run the tests for Task 2 located in the "task2" folder:

   python task2/test_task2.py

These steps will help you set up and test the implementations for both Task 1 and Task 2.