Your one-stop GitHub repo for competitive coding and data structures! 🤖 Curated notes, practice problems, and real-world applications. Sharpen your skills and ace those interviews! 💻🔥

Resolves hash table collisions using linear probing, quadratic probing, and linear hashing. All data structures implemented from scratch. Optimized for efficient time and space complexity. Written in C .

Implementing Hash-Table Lexicon using open-addressing and quadratic probing.

Generic implementation of data structs in C

This is an implementation of HashMap while tackling some collision resolution techniques.

Two HashMap implementations: 1) Separate chaining with singly linked lists; 2) Open addressing with quadratic probing

An analysis of Serparate Chaining and Quadratic Probing Algorithms in C .

This project uses a hash table with quadratic probing to store individual strands of DNA. Once the hash table reaches its capacity, all the data is copied into a new table with a capacity four times greater than the previous one.

🚀 C-based hashmap with 🔑 char* keys and 🔢 integer values. Supports setting/getting values, deletion, and auto-resizing.

android app gives linear probing, quadratic probing and double hashing tables depending upon given input.

Implementation of Hashing with collision handling, utilizing Chaining, Linear Probing, Quadratic Probing and Double Hashing.

Dictionary(ENG-TR) Using Hashing Algorithms