코딩테스트 대비 문제집(Baekjoon Online Judge)

A collection of powerful data structures

Go efficient multilingual NLP and text segmentation; support English, Chinese, Japanese and others.

Surprisingly space efficient trie in Golang(11 bits/key; 100 ns/get).

Static memory-efficient Trie-like structures for Python based on marisa-trie C++ library.

Python module (C extension and plain python) implementing Aho-Corasick algorithm

Leetcode Solutions in Rust, Advent of Code Solutions in Rust and more

C++ implementation of a fast and memory efficient HAT-trie

leetcode.com , algoexpert.io solutions in python and swift

Universal database layer for the client, server & mobile devices. It's like Lego for databases.

敏感词查找,验证,过滤和替换 🤓 FindAll, Validate, Filter and Replace words.

PruningRadixTrie - 1000x faster Radix trie for prefix search & auto-complete

🇨🇳Open Chinese Convert is an opensource project for conversion between Traditional Chinese and Simplified Chinese.(java 中文繁简体转换，支持台湾、香港、中文日文转换。)

EFFICIENT AND OPTIMIZED TOKENIZER ENGINE FOR LLM INFERENCE SERVING

.NET Implementations of Trie Data Structures for Substring Search, Auto-completion and Intelli-sense. Includes: patricia trie, suffix trie and a trie implementation using Ukkonen's algorithm.

Go datastructures.

The Capsule Hash Trie Collections Library

Adaptive Radix Trees implemented in Go

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.

Project is in active development and has been moved to the EthereumJS VM monorepo.