[NEW ALGORITHM] Add Hashmap Data Structure

[Riya7045]

Hashmap

About:

We need to implement a hashmap (hash table) data structure to support efficient key-value storage and retrieval. The hashmap will offer basic functionalities like insertion, search, and deletion, with collision handling via chaining using linked lists. This implementation should work for integer keys and values as the primary use case.

Key Tasks:

Hashmap Structure:

Define a hashmap structure that includes an array of pointers (buckets).
Each bucket should point to a linked list to handle collisions (chaining).

Hash Function:

Create a hash function that maps integer keys to an index based on the table size using modulo (% operator).

Basic Operations:

Insert: Add a key-value pair to the hashmap. Handle collisions by inserting the new entry into a linked list.
Search: Retrieve a value based on a given key. If the key is not found, return a default error code (e.g., -1).
Delete: Remove a key-value pair from the hashmap, handling re-linking of nodes in the linked list for collision cases.

Labels:

new algorithm, gssoc-ext, hacktoberfest, level1

---

Assignees:

• Contributor in GSSoC-ext
• Want to work on it

[lakshita10341]

can u assign me this issue?

[pankaj-bind]

@Riya7045 assigned

[Riya7045]

ok i will start working on this issue.