C++ template containers with optimized memory consumption

A family of header-only, very fast and memory-friendly hashmap and btree containers.

A collection of std-like containers written in C++11. Features fast unordered flat map/set, configurable double-ended vector and sparse deque.

A fast & densely stored hashmap and hashset based on robin-hood backward shift deletion

A very performant, fairly lightweight HashMap implementation in C.

Programming and algorithmization in C++ 🖥

Implementing Non Linear Data Structures Using C++

C implementations of basic C++-like container types

Techie Delight: Data Structures and Algorithm Problems

Documentation Of C++ Standard Template Library (STLs) Used In Competitive Programming

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.

The program implements a simple lock manager.

Cooking with Healthier Ingredients is a c++ programme that suggests healthier substutions according to the users health concerns

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.

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

This repository contains all the practice problems of the coding ninja DSA course.

Fast C++ flat (open addressing) hash set, map