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
Greg's Template Library of useful classes.
A collection of std-like containers written in C++11. Features fast unordered flat map/set, configurable double-ended vector and sparse deque.
Fast C++ flat (open addressing) hash set, map
A C++ program that finds and displays the unique elements between two integer arrays.
Pretty Printer for any arbitrarily nested STL container
Documentation Of C++ Standard Template Library (STLs) Used In Competitive Programming
This repository contains my solutions to the LeetCode Daily Challenges of July implemented in C++
Toolkit for hashing user-defined types for use in hash maps, sets, etc.
A very performant, fairly lightweight HashSet implementation in C.
This is a wordsearch puzzle solver. I know this is not the most efficient solution to solving a wordsearch. Using tries is much more efficient than this brute force solution. My purpose for this program was to demonstrate my knowledge of hashtables in C++ and the unordered_set is one such implementation in the C++ STL.
This repository contains my solutions to the LeetCode Daily Challenges of August implemented in C++
Add a description, image, and links to the unordered-set topic page so that developers can more easily learn about it.
To associate your repository with the unordered-set topic, visit your repo's landing page and select "manage topics."