A family of header-only, very fast and memory-friendly hashmap and btree containers.
-
Updated
May 26, 2024 - C++
A family of header-only, very fast and memory-friendly hashmap and btree containers.
A fast & densely stored hashmap and hashset based on robin-hood backward shift deletion
A plain C implementation of vector and hashtable
C++ template containers with optimized memory consumption
Compile-time single-header hash-map written in C++ 17
Simple implementation of Hash Table in C++. It's mainly intended to show how hash tables are implemented by libraries like STL.
A benchmark for hash tables and hash functions in C++, evaluate on different data as comprehensively as possible
A simple dictionary implementation in C
A collection of slot maps and hash maps optimized for unsigned keys.
The program implements a simple lock manager.
LeetCode solutions
Given a pattern and a string , find if the string follows the same pattern.
This repository provides a custom implementation of an unordered map in C++, demonstrating the working and importance of a hash function. The implementation does not rely on any external libraries and offers support for various data types.
Implement an Unordered Map in C++ using Hash Functions. Without any inbuilt function of C++.
Given an array of N integers, and an integer K, find the number of pairs of elements in the array whose sum is equal to K.
A robust C++ solution for validating parentheses in strings. This project features a well-tested algorithm that handles different types of parentheses, including (), {}, and []. It is designed to cover a wide range of scenarios, from simple to complex nested structures, ensuring the correct ordering and pairing of parentheses.
Add a description, image, and links to the unordered-map topic page so that developers can more easily learn about it.
To associate your repository with the unordered-map topic, visit your repo's landing page and select "manage topics."