21 results for “topic:hash-set”
This library provides various containers. Each container has utility functions to manipulate the data it holds. This is an abstraction as to not have to manually manage and reallocate memory.
Hash Array Mapped Trie (HAMT) implemented in Go (1.18+ generics)
(Legacy) Extremely fast unordered map and set library for C++20
Everything I need to know to get the better job.
A type-erased hash set written in C++17.
A bunch of diferent data structures implemented in c
Container with linear probing resolver collision using LCFS-hashing.
SmartCarCare is a Java-based car service management system that enables scheduling, cost estimation, and service history tracking with a user-friendly interface and flexible record management using generics.
Efficient spell checker built with a custom hash set and binary search tree. Achieves double performance using optimized collision handling. Showcases practical use of both data structures for fast dictionary lookups.
This repository contains C++ implementations of classic algorithms.
No description provided.
COP3503C Program 3: SneakyKnights
B-tree, Fibonacci Heap, Hash Set, Graph, Bounded Queue, Bounded Stack
No description provided.
Text Analyzer is a Java application that fetches and processes text from a URL, storing words into a hash set and providing various statistics.
Text Twist is a word game that requires forming minimum of three or more words from six given set of letters. The six letters may include duplicate letters.
Java exercises from computer science term 4 including hash sets, maps lists and more
CERPEC are generic C data structures that use datatype sizes for abstraction.
Hash Set with Union Find capabilities
This repository provides a comprehensive collection of C++ code examples and notes for Data Structures and Algorithms (DSA), organized by lecture. It is designed for students, learners, and competitive programmers to efficiently understand and implement core DSA concepts.
Two efficient O(N) Python solutions using hash sets: one checks if any pair sums to a target value, the other finds the largest positive number that has a negative counterpart. Includes edge-case handling and unit tests.