C++ implementation of a fast and memory efficient HAT-trie
-
Updated
Feb 10, 2024 - C++
C++ implementation of a fast and memory efficient HAT-trie
Algo-Tree is a collection of Algorithms and data structures which are fundamentals to efficient code and good software design. Creating and designing excellent algorithms is required for being an exemplary programmer. It contains solutions in various languages such as C++, Python and Java.
This repo contains solutions to problem of data structures in c++
Data-Structures using C++.
A C++ library providing fast language model queries in compressed space.
Fastest Trie structure (Linux & Windows)
Fast compressed trie dictionary library
C++17 implementation of memory-efficient dynamic tries
A repo that might help you for Data structures and Algorithms (DSA) interviews
COllapsed and COmpressed trie: a data-aware compressed string dictionary
My solution codes for 400+ algorithms and data structure problems. Most common and famous interview placement questions from Data Structures and Algorithms.
This is Data Structure and Algorithm - Notes and Codes Repo
A collection of algorithms and data structures in C++. If you loved it, give a 🌟!
String map implementation through Fast Succinct Trie
🚀 DidUMean, is a spelling checker application checks your spelling and recommend words for you in case of wrong spelling ...
Fast fuzzy string search
My Leetcode Solutions
Add a description, image, and links to the trie topic page so that developers can more easily learn about it.
To associate your repository with the trie topic, visit your repo's landing page and select "manage topics."